Metraipolis › archive › dc_b8fd809ccd88

The sum of sizes of nontrivial cross-intersecting families — arXiv:2611.00148

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.00148
License (as archived)
CC0-1.0
Archived
2026-11-03T11:36:30.153Z
SHA-256 of the archived text
61ab786f512bea1196326271e4fad3c086a44f8b85ce0f15c93561778470895c
Stable URL of this page
https://metraipolis.com/documento/dc_b8fd809ccd88

How to cite

The sum of sizes of nontrivial cross-intersecting families — arXiv:2611.00148 — arXiv (en), https://arxiv.org/abs/2611.00148 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b8fd809ccd88 (Metraipolis archive dc_b8fd809ccd88, sha256 61ab786f512bea1196326271e4fad3c086a44f8b85ce0f15c93561778470895c)
BibTeX
@misc{dcb8fd809ccd88,
  title = {The sum of sizes of nontrivial cross-intersecting families — arXiv:2611.00148},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.00148},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b8fd809ccd88; sha256 61ab786f512bea1196326271e4fad3c086a44f8b85ce0f15c93561778470895c},
  year = {2026}
}

Archived text

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

Families $\mathcal A_1,\ldots,\mathcal A_m\subseteq\binom{[n]}k$ are cross-intersecting if every member of one family meets every member of each other family. A family is nontrivial if its members have no common element. For $n>2k$ and $m\ge3$, we determine the maximum sum of the sizes of $m$ nonempty, nontrivial cross-intersecting families. We prove the sharp bound \[ \sum_{i=1}^{m}|\mathcal A_i| \le \max\bigl\{m\,h(n,k,1),\ g(n,k)+3(m-1)\bigr\}, \] where \[ h(n,k,1)=\binom{n-1}{k-1}-\binom{n-k-1}{k-1}+1 \] and \[ g(n,k)=\binom nk-2\binom{n-k}k -\binom{n-k-1}{k-1}+\binom{n-2k+1}k. \] We also characterize all equality cases. Two types of extremal configurations arise: copies of a maximum nontrivial intersecting family, and copies of a specific three-member nontrivial intersecting family together with its full cross-intersecting companion. The proof applies a known restricted lexicographic comparison to obtain the weighted bound for shifted families, and uses local generator reductions for critically shifted families. These reductions exploit shiftedness after removing the common core of a section, while preserving nontriviality and the required shadow relations between sections.

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.00148 — 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-03T11:05:22.226Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).