Zaks's conjecture on perfect matchings in connected graphs
Let and be integers, and let be a matchable -connected graph with vertices. Zaks's conjecture. Every such graph satisfies
moreover, infinitely many graphs attain equality. The conjecture is disproved by the counterexamples constructed in the paper.
References
- Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede and Carol T. Zamfirescu, “On the number of perfect matchings in planar graphs”, arXiv:2606.22253 (2026).
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.