Metraipolis › archive › dc_cdc5ca4053e4

Ore-degree conditions for matchings in uniform hypergraphs — arXiv:2611.09064

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.09064
License (as archived)
CC0-1.0
Archived
2026-11-09T22:43:48.154Z
SHA-256 of the archived text
81c3ef631264452382fa7a9c87ecedf264b84ec539d65207f2cdc3b8327b2b0d
Stable URL of this page
https://metraipolis.com/documento/dc_cdc5ca4053e4

How to cite

Ore-degree conditions for matchings in uniform hypergraphs — arXiv:2611.09064 — arXiv (en), https://arxiv.org/abs/2611.09064 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cdc5ca4053e4 (Metraipolis archive dc_cdc5ca4053e4, sha256 81c3ef631264452382fa7a9c87ecedf264b84ec539d65207f2cdc3b8327b2b0d)
BibTeX
@misc{dccdc5ca4053e4,
  title = {Ore-degree conditions for matchings in uniform hypergraphs — arXiv:2611.09064},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.09064},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cdc5ca4053e4; sha256 81c3ef631264452382fa7a9c87ecedf264b84ec539d65207f2cdc3b8327b2b0d},
  year = {2026}
}

Archived text

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

Let $\sigma_r(\mathcal{H})$ be the minimum sum of vertex degrees over all nonedges of an $r$-uniform hypergraph $\mathcal{H}$ on $n$ vertices. Balogh, Palmer and Raeisi conjectured that $n>2rs$ and $\sigma_r(\mathcal{H})>r[\binom{n-1}{r-1}-\binom{n-s}{r-1}]$ imply the existence of a matching of size $s$ in $\mathcal{H}$. We prove that, for every fixed $r\ge3$ and all sufficiently large $s$, $\sigma_r(\mathcal{H})>r[\binom{n-1}{r-1}-\binom{n-s}{r-1}]$ forces an $s$-matching whenever $n\ge rs+\lfloor(r-1)^{r-1}/r^{r-2}\rfloor$. A complete $r$-graph on $rs-1$ vertices together with $\lfloor(r-1)^{r-1}/r^{r-2}\rfloor$ isolated vertices shows that the vertex bound is sharp for all sufficiently large $s$. By adding new vertices to $\mathcal{H}$, retaining all its edges, and adding every $r$-set containing at least one new vertex as an edge, we also deduce that $n\ge rs+C$ suffices under the same degree condition for every $s\ge1$, where $C$ is a finite constant depending only on $r$. For $r=3$, we provide the explicit sufficient order $n\ge\lceil(7s+11)/2\rceil$ for $s\ge6$, together with bounds for $2\le s\le5$, establishing the conjecture in this uniformity. For $s=2$, we improve the known sufficient order $2r+2$ to $2r+1$ for every $r\ge3$ and show that this order is best possible.

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.09064 — 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-09T22:36:32.139Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).