The asymptotic fractional matching threshold conjecture for uniform hypergraphs
Let denote the minimum -degree forcing a fractional matching of the relevant size in a -uniform hypergraph, with . Fractional matching threshold conjecture. For all ,
The lower bound comes from the construction ; the claim is confirmed asymptotically when , but is not established for all parameters.
References
- Noga Alon, Peter Frankl, Hao Huang, Vojtech Rodl, Andrzej Rucinski and Benny Sudakov, “Large matchings in uniform hypergraphs and the conjectures of Erdos and Samuels”, arXiv:1107.1219 (2012).
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.