Metraipolis › archive › dc_ec099bae5086

Typical intersecting families at $n=2k+1$ and $n=2k+2$ — arXiv:2610.02119

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.02119
License (as archived)
CC0-1.0
Archived
2026-10-06T17:41:42.247Z
SHA-256 of the archived text
d13d35c38446e1251f5bf5656cb3f67df27b934bac39dfea0edfc510cede7d3d
Stable URL of this page
https://metraipolis.com/documento/dc_ec099bae5086

How to cite

Typical intersecting families at $n=2k+1$ and $n=2k+2$ — arXiv:2610.02119 — arXiv (en), https://arxiv.org/abs/2610.02119 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ec099bae5086 (Metraipolis archive dc_ec099bae5086, sha256 d13d35c38446e1251f5bf5656cb3f67df27b934bac39dfea0edfc510cede7d3d)
BibTeX
@misc{dcec099bae5086,
  title = {Typical intersecting families at $n=2k+1$ and $n=2k+2$ — arXiv:2610.02119},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.02119},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ec099bae5086; sha256 d13d35c38446e1251f5bf5656cb3f67df27b934bac39dfea0edfc510cede7d3d},
  year = {2026}
}

Archived text

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

A family of sets is intersecting if every two members intersect, and trivial if all its members contain a common element. We determine the typical structure of $k$-uniform intersecting families on $2k+1$ and $2k+2$ elements as $k\to\infty$. For $n=2k+2$, we prove that almost all intersecting families are trivial and that their number is \[ (2k+2+o(1))\,2^{\binom{2k+1}{k-1}}. \] Together with Yang's recent result for $n\ge 2k+3$, this settles a conjecture of Balogh, Garcia, Li, and Wagner. For $n=2k+1$, almost all intersecting families are nontrivial. We prove that, as conjectured by the same authors, a typical intersecting family is close to a full star: its members outside the star form components of size at most two in the graph joining sets that intersect in $k-1$ elements. We also obtain an asymptotic formula for the number of intersecting families in this case, with an explicit second-order term in the exponent. Our proof combines Sapozhenko's graph container method and stability in Kneser graphs to control families far from every star, and a polymer model and cluster expansion to enumerate families close to a fixed star.

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