Metraipolis › archive › dc_ce81136463fb
The quadratic Brown--Erdős--Sós problem for 3-uniform hypergraphs with 8 and 9 edges — arXiv:2610.03323
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.03323
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T08:25:11.434Z
- SHA-256 of the archived text
b312789ddfad19f369f2a59935ed6131bb734f8a2574881191ec83ee6a0feec0- Stable URL of this page
https://metraipolis.com/documento/dc_ce81136463fb
How to cite
The quadratic Brown--Erdős--Sós problem for 3-uniform hypergraphs with 8 and 9 edges — arXiv:2610.03323 — arXiv (en), https://arxiv.org/abs/2610.03323 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ce81136463fb (Metraipolis archive dc_ce81136463fb, sha256 b312789ddfad19f369f2a59935ed6131bb734f8a2574881191ec83ee6a0feec0)
BibTeX
@misc{dcce81136463fb,
title = {The quadratic Brown--Erdős--Sós problem for 3-uniform hypergraphs with 8 and 9 edges — arXiv:2610.03323},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.03323},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ce81136463fb; sha256 b312789ddfad19f369f2a59935ed6131bb734f8a2574881191ec83ee6a0feec0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.03323. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The famous and actively studied problem of Brown--Erdős--Sós from 1973 asks for $f^{(r)}(n;s,k)$, the maximum number of edges in an $r$-graph with $n$ vertices in which no $s$ vertices span $k$ or more edges. In this paper, we concentrate on the case $r=3$ and $s=k+2$, with $k\ge2$ fixed and $n\to\infty$; then it is easy to show that the extremal function grows quadratically in $n$. Delcourt and Postle proved that the limit $\pi(k):=\lim_{n\to\infty} f^{(3)}(n;k+2,k)/n^2$ exists for every $k$. While Brown, Erdős and Sós observed that $\pi(2)=1/6$ already in the 1970s, the value of $\pi(k)$ for $3\le k\le 7$ was determined only recently (by various subgroups of Glock, Joos, Kim, Kühn, Lichev, Pikhurko, and Sun). Very recently, Chao, Huang and Liu determined $\pi(k)$ for every odd $k$. Independently of the last result, we show that $\pi(9)=1/5$. Also, we prove that $\pi(8)\le {5053}/{26544}$, which is within $0.0029$ of the best known lower bound $\pi(8)\ge 3/16$. The new upper bounds are obtained by expressing some previous arguments as a linear program and then using a computer to generate and solve its instances. Our proof of the lower bound on $\pi(9)$ is based on a finite field construction combined with existing packing results.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-05 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.03323 — 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-06T08:18:48.306Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).