Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2503.22490

Graphs generated from minimal sets of finite point-set topologies

Ketai Chen·Jared DeLeo·Owen Henderschedt
View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ketai Chen, Jared DeLeo, Owen Henderschedt. 2025-03-28. Graphs generated from minimal sets of finite point-set topologies. https://arxiv.org/abs/2503.22490

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗