Search arXivSearch

arXiv · 1706.05181

Nerves, minors, and piercing numbers

Abstract

We make the first step towards a "nerve theorem" for graphs. Let $G$ be a simple graph and let $\mathcal{F}$ be a family of induced subgraphs of $G$ such that the intersection of any members of $\mathcal{F}$ is either empty or connected. We show that if the nerve complex of $\mathcal{F}$ has non-vanishing homology in dimension three, then $G$ contains the complete graph on five vertices as a minor. As a consequence we confirm a conjecture of Goaoc concerning an extension of the planar $(p,q)$ theorem due to Alon and Kleitman: Let $\mathcal{F}$ be a finite family of open connected sets in the plane such that the intersection of any members of $\mathcal{F}$ is either empty or connected. If among any $p \geq 3$ members of $\mathcal{F}$ there are some three that intersect, then there is a set of $C$ points which intersects every member of $\mathcal{F}$, where $C$ is a constant depending only on $p$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andreas F. Holmsen, Minki Kim, Seunghun Lee. 2018-02-20. Nerves, minors, and piercing numbers. https://doi.org/10.1090/tran%2F7608

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

KEEP EXPLORING

Related papers

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

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