Metraipolis › archive › dc_099d882a37bd
Quadratic bounds for intersecting hypergraphs: An affirmative answer to a question of Duke and Erdős — arXiv:2611.01915
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01915
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:50:20.609Z
- SHA-256 of the archived text
97e691d6c5d83e54fc8933205d4791f30d2448e75b8171a74f3b9bcef117b262- Stable URL of this page
https://metraipolis.com/documento/dc_099d882a37bd
How to cite
Quadratic bounds for intersecting hypergraphs: An affirmative answer to a question of Duke and Erdős — arXiv:2611.01915 — arXiv (en), https://arxiv.org/abs/2611.01915 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_099d882a37bd (Metraipolis archive dc_099d882a37bd, sha256 97e691d6c5d83e54fc8933205d4791f30d2448e75b8171a74f3b9bcef117b262)
BibTeX
@misc{dc099d882a37bd,
title = {Quadratic bounds for intersecting hypergraphs: An affirmative answer to a question of Duke and Erdős — arXiv:2611.01915},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01915},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_099d882a37bd; sha256 97e691d6c5d83e54fc8933205d4791f30d2448e75b8171a74f3b9bcef117b262},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01915. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $m(k,b)$ denote the minimum number of edges in an intersecting $k$-uniform hypergraph in which every $(k-1)$-set of vertices is disjoint from at least $b$ edges, with $m(k,b)=+\infty$ if no such hypergraph exists. Duke and Erdős [Congressus Numerantium (1980)] asked whether $m(k,k)=o(k^4)$ is possible. In this paper, we answer this question affirmatively and determine the order of growth of $m(k,k)$ by proving that $k^2+1\leq m(k,k)\leq Ck^2$ for all sufficiently large $k$, where $C$ is an absolute constant. More generally, we show that $m(k,b)=\Theta(kb)$ for all sufficiently large odd $k$ and every integer $b$ with $k\leq b\leq (k-1)(k-3)/2$, where the implied constants are independent of $k$ and $b$. 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.01915 — 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.083Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).