Metraipolis › archive › dc_588182dcd8c2

Kohayakawa's conjecture and clique coverings of complements of paths and cycles — arXiv:2608.11132

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.11132
License (as archived)
CC0-1.0
Archived
2026-10-19T06:27:30.952Z
SHA-256 of the archived text
ab8124a132bb83973330d280787abf522d0367e51005a9b08c07100dac3e77bf
Stable URL of this page
https://metraipolis.com/documento/dc_588182dcd8c2

How to cite

Kohayakawa's conjecture and clique coverings of complements of paths and cycles — arXiv:2608.11132 — arXiv (en), https://arxiv.org/abs/2608.11132 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_588182dcd8c2 (Metraipolis archive dc_588182dcd8c2, sha256 ab8124a132bb83973330d280787abf522d0367e51005a9b08c07100dac3e77bf)
BibTeX
@misc{dc588182dcd8c2,
  title = {Kohayakawa's conjecture and clique coverings of complements of paths and cycles — arXiv:2608.11132},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.11132},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_588182dcd8c2; sha256 ab8124a132bb83973330d280787abf522d0367e51005a9b08c07100dac3e77bf},
  year = {2026}
}

Archived text

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

For $s\ge1$, let $G_s$ be the bipartite graph between the $s$-subsets and the $(s-1)$-subsets of $[2s]$, where adjacency means disjointness, and let $w(s)$ be the maximum number of $s$-subsets on an induced path in $G_s$. We prove $w(s)\ge \frac{4^s}{2048s^{5/2}}$ for all $s\geq 6$. This implies $\sup_{s\ge1}w(s)^{1/s}=4$, as conjectured by Kohayakawa (1991). His recursive construction then gives induced paths of order $\Omega(4^r/r^{5/2})$ in the Kneser graph $KG(2r+1,r)$ and yields \[ \max\{\cc(\overline{P_n}),\ \cc(\overline{C_n})\} \le \log_2 n+\frac52\log_2\log_2 n+O(1). \] Together with the known lower bounds, this settles a conjecture of de Caen, Gregory, and Pullman (1985) and gives \[ \cc(\overline{P_n})=\log_2 n+\Theta(\log_2\log_2 n), \qquad \cc(\overline{C_n})=\log_2 n+\Theta(\log_2\log_2 n). \] We also give an independent proof of the latter order estimates. It uses a Hamiltonicity result of Kneser graphs and a key lemma proved by the Lovász local lemma.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-12 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.11132 — 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-19T06:20:30.696Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).