Metraipolis › archive › dc_cd46d3cdc0e8
Ore-degree conditions for hypergraph matchings — arXiv:2610.41787
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41787
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T08:00:22.695Z
- SHA-256 of the archived text
5582917ec2c053461da1ff0b8849179576f356f883e1218a757f50609780965d- Stable URL of this page
https://metraipolis.com/documento/dc_cd46d3cdc0e8
How to cite
Ore-degree conditions for hypergraph matchings — arXiv:2610.41787 — arXiv (en), https://arxiv.org/abs/2610.41787 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cd46d3cdc0e8 (Metraipolis archive dc_cd46d3cdc0e8, sha256 5582917ec2c053461da1ff0b8849179576f356f883e1218a757f50609780965d)
BibTeX
@misc{dccd46d3cdc0e8,
title = {Ore-degree conditions for hypergraph matchings — arXiv:2610.41787},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41787},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cd46d3cdc0e8; sha256 5582917ec2c053461da1ff0b8849179576f356f883e1218a757f50609780965d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41787. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $\sigma_k(H)$ be the minimum sum of the vertex degrees over all non-edges of an $n$-vertex $k$-uniform hypergraph $H$. For every $k\ge3$, $n\geq ks$ and sufficiently large $n$, we establish a sharp Ore-type degree condition that forces a matching of size $s$ in $H$. Specifically, we prove that if \[ \sigma_k(H)>\max\left\{ k\left(\binom{n-1}{k-1}-\binom{n-s}{k-1}\right), (k-c)\binom{ks-2}{k-1}\right\}, \] then $H$ has a matching of size $s$, where $c=n-ks+1$. In particular, this proves a conjecture of Balogh, Palmer and Raeisi for $k\geq 3$ and sufficiently large $n$.
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.41787 — 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-02T07:42:45.745Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).