{
  "abstract": "Let $σ_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 \\[ σ_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$.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.41787",
  "author_total": 4,
  "authors": [
    {
      "name": "Mingyang Guo"
    },
    {
      "name": "Tianhong Kan"
    },
    {
      "name": "Hongliang Lu"
    },
    {
      "name": "Feihong Yuan"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/24kz75g862gf7.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.41787",
  "fulltext_url": null,
  "id": "24kz75g862gf7",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.41787",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.CO"
    ]
  ],
  "openalex": null,
  "pdf_url": "https://arxiv.org/pdf/2610.41787",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-30",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/24kz75g862gf7.ris",
  "sources": [
    {
      "first_seen": "2026-11-02T12:21:20Z",
      "native_id": "2610.41787",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.41787"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "Ore-degree conditions for hypergraph matchings",
  "title_text": "Ore-degree conditions for hypergraph matchings",
  "type": "preprint",
  "updated_at": "2026-11-04T15:20:53Z",
  "url": "https://research.draconitic.com/paper/24kz75g862gf7",
  "venue": "arXiv",
  "versions": []
}