Local spectral matching conjecture for 3-graphs
Let denote the link graph of a vertex in a -graph , and let be its spectral radius. For integers with , let be a -graph with vertex set .
Local spectral matching conjecture. If, for every ,
then has a matching of size . Moreover, if and, for every ,
then contains a perfect matching.
This conjecture asks whether a lower bound on the spectral radius of every link graph forces a large, or in the extremal case perfect, matching in a -graph. The preceding theorem establishes a related sufficient condition with threshold for sufficiently large divisible by ; the conjectured bounds are presented as asymptotically tight based on the stated constructions, and the supplied text gives no proof of the conjecture itself.
References
- Huiqiu Lin, Hongliang Lu, Feihong Yuan and Xiaonan Zhao, “A local spectral condition for perfect matchings in 3-graphs”, arXiv:2604.13726 (2026).
Progress summary
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.