English

Nerves, minors, and piercing numbers

Combinatorics 2019-07-04 v3

Abstract

We make the first step towards a "nerve theorem" for graphs. Let GG be a simple graph and let F\mathcal{F} be a family of induced subgraphs of GG such that the intersection of any members of F\mathcal{F} is either empty or connected. We show that if the nerve complex of F\mathcal{F} has non-vanishing homology in dimension three, then GG 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)(p,q) theorem due to Alon and Kleitman: Let F\mathcal{F} be a finite family of open connected sets in the plane such that the intersection of any members of F\mathcal{F} is either empty or connected. If among any p3p \geq 3 members of F\mathcal{F} there are some three that intersect, then there is a set of CC points which intersects every member of F\mathcal{F}, where CC is a constant depending only on pp.

Keywords

Cite

@article{arxiv.1706.05181,
  title  = {Nerves, minors, and piercing numbers},
  author = {Andreas F. Holmsen and Minki Kim and Seunghun Lee},
  journal= {arXiv preprint arXiv:1706.05181},
  year   = {2019}
}
R2 v1 2026-06-22T20:20:40.561Z