Metraipolis › archive › dc_ea595aa7c168

Alon's conjecture on intersecting families of graphs — arXiv:2609.13145

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.13145
License (as archived)
CC0-1.0
Archived
2026-10-16T03:49:27.142Z
SHA-256 of the archived text
1a049210be04506391ad6df8e381caf533ce311b133fd14ecab0e19a1cfc3ab4
Stable URL of this page
https://metraipolis.com/documento/dc_ea595aa7c168

How to cite

Alon's conjecture on intersecting families of graphs — arXiv:2609.13145 — arXiv (en), https://arxiv.org/abs/2609.13145 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ea595aa7c168 (Metraipolis archive dc_ea595aa7c168, sha256 1a049210be04506391ad6df8e381caf533ce311b133fd14ecab0e19a1cfc3ab4)
BibTeX
@misc{dcea595aa7c168,
  title = {Alon's conjecture on intersecting families of graphs — arXiv:2609.13145},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.13145},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ea595aa7c168; sha256 1a049210be04506391ad6df8e381caf533ce311b133fd14ecab0e19a1cfc3ab4},
  year = {2026}
}

Archived text

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

Given a graph $F$, a family $\mathcal F$ of graphs on $[n]$ is \emph{$F$-intersecting} if $G\cap H$ contains a copy of $F$ for every $G,H\in\mathcal F$. We prove that there exists an absolute constant $\varepsilon>0$ such that every $P_4$-intersecting family $\mathcal F$ satisfies $|\mathcal F|\le\left(\frac12-\varepsilon\right)2^{\binom n2}$, which resolves a conjecture of Alon. Combined with Alon's reduction, this proves that a graph $F$ admits $F$-intersecting families of asymptotic density $1/2$ if and only if $F$ is a star forest. Multi-colored versions are also considered.

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