Metraipolis › archive › dc_f209fcaacf9a

The Erdős-Pósa Property for Colorful Minors — arXiv:2609.04956

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.04956
License (as archived)
CC0-1.0
Archived
2026-10-16T23:21:02.199Z
SHA-256 of the archived text
fedcc8d2356120abbca202a1144251174cdd47c008036e5a546c6f2cf16708d3
Stable URL of this page
https://metraipolis.com/documento/dc_f209fcaacf9a

How to cite

The Erdős-Pósa Property for Colorful Minors — arXiv:2609.04956 — arXiv (en), https://arxiv.org/abs/2609.04956 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f209fcaacf9a (Metraipolis archive dc_f209fcaacf9a, sha256 fedcc8d2356120abbca202a1144251174cdd47c008036e5a546c6f2cf16708d3)
BibTeX
@misc{dcf209fcaacf9a,
  title = {The Erdős-Pósa Property for Colorful Minors — arXiv:2609.04956},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.04956},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f209fcaacf9a; sha256 fedcc8d2356120abbca202a1144251174cdd47c008036e5a546c6f2cf16708d3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.04956. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A colorful graph relation enhances the minor relation by merging color sets along contractions and by allowing the removal of colors; it generalizes rooted minors and models problems on graphs with several, possibly overlapping, annotated vertex sets. A graph has the Erdős-Pósa property for minors if and only if it is planar, by a classical theorem of Robertson and Seymour. In this work we determine, for the colorful minor relation, exactly which colorful graphs have the Erdős-Pósa property. Our characterization takes three equivalent forms. The first is structural: the colorful graphs with the property are those that can be drawn with all their colored vertices on one face and whose colors are, in a precise sense, laid out along that face without interleaving. The second is given by an obstruction set: they are those excluding every member of an explicit infinite family $\mathcal{O},$ of which only $\mathbf{O}(|I|^{4})$ members have colors that are a subset of $I,$ for every finite set $I$ of colors. The third is grid-like: they are exactly the colorful minors of unions of particular families of segregated grids, the colorful analogues of the grids that drive the classical proof.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-07 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2609.04956 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T23:03:13.252Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).