Metraipolis › archive › dc_605b76a487ba
Large Maximal Intersecting Families with Covering Number Three — arXiv:2611.00149
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.00149
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:49:18.611Z
- SHA-256 of the archived text
f5137d12e5b5218d83f2aaa4c77ccf978461e67ecd1ce23c1cc23016d43d2e29- Stable URL of this page
https://metraipolis.com/documento/dc_605b76a487ba
How to cite
Large Maximal Intersecting Families with Covering Number Three — arXiv:2611.00149 — arXiv (en), https://arxiv.org/abs/2611.00149 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_605b76a487ba (Metraipolis archive dc_605b76a487ba, sha256 f5137d12e5b5218d83f2aaa4c77ccf978461e67ecd1ce23c1cc23016d43d2e29)
BibTeX
@misc{dc605b76a487ba,
title = {Large Maximal Intersecting Families with Covering Number Three — arXiv:2611.00149},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.00149},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_605b76a487ba; sha256 f5137d12e5b5218d83f2aaa4c77ccf978461e67ecd1ce23c1cc23016d43d2e29},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00149. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $n>2k$ and $k\ge4$. The largest size of an intersecting family of $k$-subsets of $[n]$ with covering number at least three is \[ g_1(n,k)=\binom{n-1}{k-1}-3\binom{n-k-1}{k-1}+\binom{n-k-2}{k-1}+\binom{n-2k}{k-1}+3, \] attained by a unique family up to isomorphism. We prove that every other maximal intersecting family $\mathcal F$ with covering number three satisfies \[ |\mathcal F|\le M(n,k)=\max\{q(n,k),g_2(n,k)\}, \] where \begin{align*} q(n,k)&=\binom{n-1}{k-1}-3\binom{n-k-1}{k-1}+\binom{n-k-3}{k-1}+\binom{n-2k+1}{k-1}+3,\\ g_2(n,k)&=g_1(n,k)-\binom{n-k-3}{k-3}+1. \end{align*} This bound is attained for every $n>2k$ and $k\ge4$, so $M(n,k)$ is the second largest distinct size. For $k=4$, $g_1(n,4)=13n-69$ and $M(n,4)=12n-61$. For $k\ge5$, we have $M(n,k)=q(n,k)$ when $2k<n\le3k-2$ and $M(n,k)=g_2(n,k)$ when $n\ge3k-2$; the two terms coincide only at $n=3k-2$. We also classify all families attaining $M(n,k)$ that admit a critically shifted labeling, including additional nonisomorphic families at $n=2k+1$. The proof combines local replacements with an inverse-shift estimate and gives a new proof of the known maximum and its uniqueness.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.00149 — 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-11-03T18:15:38.039Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).