Metraipolis › archive › dc_bf429a0e9891
Hypergraph Universality and Erdos-Posa Failure for Chromatically Rich Odd Cycles — arXiv:2609.26158
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.26158
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T15:56:00.766Z
- SHA-256 of the archived text
2612a8a3a21bf15228405ede035ee4c95b03c3eee4082a6275bb378ed12836d2- Stable URL of this page
https://metraipolis.com/documento/dc_bf429a0e9891
How to cite
Hypergraph Universality and Erdos-Posa Failure for Chromatically Rich Odd Cycles — arXiv:2609.26158 — arXiv (en), https://arxiv.org/abs/2609.26158 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bf429a0e9891 (Metraipolis archive dc_bf429a0e9891, sha256 2612a8a3a21bf15228405ede035ee4c95b03c3eee4082a6275bb378ed12836d2)
BibTeX
@misc{dcbf429a0e9891,
title = {Hypergraph Universality and Erdos-Posa Failure for Chromatically Rich Odd Cycles — arXiv:2609.26158},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.26158},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bf429a0e9891; sha256 2612a8a3a21bf15228405ede035ee4c95b03c3eee4082a6275bb378ed12836d2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.26158. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For every fixed $k\ge 3$, every finite nonempty clutter $\mathcal{H}$ can be realized exactly as the family of inclusion-minimal terminal traces of the $k$-bad odd cycles, namely the odd cycles $C$ satisfying $\chi(G[V(C)])\ge k+1$. The host graph $G$ may be chosen $2$-connected, with $T=V(\mathcal{H})$ independent, and with $\chi(G)=k+1$, $\omega(G)=k$, and $|E(G)|\le k|V(G)|$. Given any integer $B\ge 1$, one realization simultaneously preserves the transversal number, the fractional packing number, and every integer $c$-packing number for $1\le c\le B$. Thus chromatic richness on odd-cycle spans has the full packing-covering complexity of arbitrary finite set systems, even in sparse graphs whose chromatic number exceeds their clique number by one. As a consequence, for every $b,N\ge 1$ and every $\varepsilon>0$, there is such a graph with $\tau_k(G)=N$, $\nu_k^{1/c}(G)=c$ for every $1\le c\le b$, and $\nu_k^*(G)<1+\varepsilon$. Hence every finite-congestion and fractional Erdős--Pósa property fails for $k\ge 3$, with an asymptotically optimal fractional obstruction. This contrasts sharply with $k=2$, where the relevant cycles are the ordinary odd cycles: the integral property fails, while Reed's theorem yields every congestion level at least two and the fractional property. We also characterize the shortest $k$-bad odd cycles by a single fixed witness graph.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.26158 — 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-08T15:16:21.690Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).