Kahn’s matching-concentration conjecture
This entry tracks Kahn’s matching-concentration conjecture.
It advances predicted local behavior of large matchings and has enumeration applications.
Latest development
An averaged version is proved for regular linear hypergraphs, with related results for nearly regular low-codegree hypergraphs.
Editorial caveat
The full uniform conjecture remains outside the stated hypotheses.
References
- Matching statistics in regular hypergraphs and applications — arXiv — Hyunwoo Lee
Source: arXiv
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.