Metraipolis › archive › dc_b7bcb931daad
A linear upper bound for Berge saturation numbers — arXiv:2610.11409
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.11409
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T06:29:03.199Z
- SHA-256 of the archived text
fb2f0308adcdf4665dca2bea4d77bf7611660e34423dae8d1054089166a85467- Stable URL of this page
https://metraipolis.com/documento/dc_b7bcb931daad
How to cite
A linear upper bound for Berge saturation numbers — arXiv:2610.11409 — arXiv (en), https://arxiv.org/abs/2610.11409 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b7bcb931daad (Metraipolis archive dc_b7bcb931daad, sha256 fb2f0308adcdf4665dca2bea4d77bf7611660e34423dae8d1054089166a85467)
BibTeX
@misc{dcb7bcb931daad,
title = {A linear upper bound for Berge saturation numbers — arXiv:2610.11409},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.11409},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b7bcb931daad; sha256 fb2f0308adcdf4665dca2bea4d77bf7611660e34423dae8d1054089166a85467},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.11409. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For a graph $F$ with at least one edge, a $k$-uniform hypergraph is Berge-$F$-saturated if it contains no Berge-$F$, but adding any missing hyperedge creates a Berge-$F$. The saturation number $\text{sat}_k(n,\text{Berge-}F)$ is the minimum number of edges in such a hypergraph on $n$ vertices. English, Gordon, Graber, Methuku and Sullivan conjectured a linear upper bound for every fixed finite family of forbidden graphs. We prove the single-graph case: $\text{sat}_k(n,\text{Berge-}F)=O_{F,k}(n)$ for every fixed integer $k\ge2$ and every fixed finite simple graph $F$ with at least one edge. The proof combines a sparse construction with degree and matching arguments.
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/2610.11409 — 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-09T05:53:57.193Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).