← All problems

Balogh–Palmer–Raeisi Ore-degree conjecture

For integers k≥3k\ge 3, s≥2s\ge 2, and n≥ksn\ge ks, let H=(V,E)H=(V,E) be an nn-vertex kk-uniform hypergraph. Define

σk(H)=min⁡{∑v∈edH(v):e∈(Vk)∖E},\sigma_k(H)=\min\left\{\sum_{v\in e}d_H(v):e\in\binom{V}{k}\setminus E\right\},

where dH(v)d_H(v) is the degree of vv in HH. Set c=n−ks+1c=n-ks+1. If

σk(H)>max⁡{k((n−1k−1)−(n−sk−1)),(k−c)(ks−2k−1)},\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 HH contains a matching of size ss, that is, ss pairwise vertex-disjoint edges.

References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

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 s≥2s\ge 2 and n≥3r2(s−1)n\ge 3r^2(s-1), Balogh, Palmer, and Raeisi (2026) proved that the relevant Ore-degree condition forces ss pairwise disjoint edges.

October 2026 claimed large-nn theorem

Mingyang Guo, Tianhong Kan, Hongliang Lu, and Feihong Yuan claim that, for every k≥3k\ge 3 and sufficiently large nn, their sharp Ore-degree bound forces a matching of size ss, 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 k≥3k\ge 3 when nn is sufficiently large, while the remaining parameter ranges are open and the new proof is unverified.

Sources

Solutions 0

No solutions have been posted yet.