Kahn's matching-uncovered probability conjecture for regular linear hypergraphs
Let be a -regular linear -graph, and let be a matching chosen uniformly from the set of all matchings of . For a vertex , write for the probability that does not cover . Kahn's conjecture. For every ,
Kahn proposed this as an asymptotic description of the average size of random matchings in regular linear hypergraphs.
References
Status
- Refuted: E. Davies, M. Jenssen, W. Perkins, and B. Roberts. Random matchings in linear hypergraphs (arXiv preprint, 2024) https://arxiv.org/abs/2406.06421
Source: Hyunwoo Lee, “Random matchings in linear hypergraphs”, arXiv:2406.06421 (2024).
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.