Balogh–Palmer–Raeisi Ore-degree conjecture
For integers , , and , let be an -vertex -uniform hypergraph. Define
where is the degree of in . Set . If
then contains a matching of size , that is, pairwise vertex-disjoint edges.
References
- Ore-degree conditions for hypergraph matchings — arXiv — Mingyang Guo, Tianhong Kan, Hongliang Lu, Feihong Yuan
Source: arXiv
Progress summary
An October 2026 preprint claims the conjecture for sufficiently large hypergraphs, but the full range of cases remains open.
The conjecture, introduced by Balogh, Palmer, and Raeisi in a preprint submitted on March 6, 2026, proposes an Ore-degree condition forcing a matching in a uniform hypergraph.
Known results
- For and , Balogh, Palmer, and Raeisi (2026) proved that the relevant Ore-degree condition forces pairwise disjoint edges.
October 2026 claimed large- theorem
Mingyang Guo, Tianhong Kan, Hongliang Lu, and Feihong Yuan claim that, for every and sufficiently large , their sharp Ore-degree bound forces a matching of size , thereby proving the Balogh–Palmer–Raeisi conjecture in that regime. The paper reports that ChatGPT assisted with developing part of the proof and preparing the manuscript.
Current status (as of November 2026): The conjecture is claimed for every when is sufficiently large, while the remaining parameter ranges are open and the new proof is unverified.
Solutions 0
No solutions have been posted yet.