Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.22490 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910898087526400 |
|---|---|
| author | Chen, Ketai DeLeo, Jared Henderschedt, Owen |
| author_facet | Chen, Ketai DeLeo, Jared Henderschedt, Owen |
| contents | In 1985, Golumbic and Scheinerman established an equivalence between comparability graphs and containment graphs, graphs whose vertices represent sets, with edges indicating set containment. A few years earlier, McMorris and Zaslavsky characterized upper bound graphs, those derived from partially ordered sets where two elements share an edge if they have a common upper bound, by a specific edge clique cover condition. In this paper, we introduce a unifying framework for these results using finite point set topologies. Given a finite topology, we define a graph whose vertices correspond to its elements, with edges determined by intersections of their minimal containing sets, where intersection is understood in terms of the topological separation axioms. This construction yields a natural sequence of graph classes, one for each separation axiom, that connects and extends both classical results in a structured and intuitive way. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_22490 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Graphs generated from minimal sets of finite point-set topologies Chen, Ketai DeLeo, Jared Henderschedt, Owen Combinatorics 05C75, 05C62, 54H99 In 1985, Golumbic and Scheinerman established an equivalence between comparability graphs and containment graphs, graphs whose vertices represent sets, with edges indicating set containment. A few years earlier, McMorris and Zaslavsky characterized upper bound graphs, those derived from partially ordered sets where two elements share an edge if they have a common upper bound, by a specific edge clique cover condition. In this paper, we introduce a unifying framework for these results using finite point set topologies. Given a finite topology, we define a graph whose vertices correspond to its elements, with edges determined by intersections of their minimal containing sets, where intersection is understood in terms of the topological separation axioms. This construction yields a natural sequence of graph classes, one for each separation axiom, that connects and extends both classical results in a structured and intuitive way. |
| title | Graphs generated from minimal sets of finite point-set topologies |
| topic | Combinatorics 05C75, 05C62, 54H99 |
| url | https://arxiv.org/abs/2503.22490 |