3-extendability conjecture for optimal 1-embedded graphs on the Klein bottle
Let be an -regular optimal -embedded graph on the Klein bottle. A graph is -extendable if every matching of size extends to a perfect matching.
3-extendability conjecture. Every -regular optimal -embedded graph on the Klein bottle is -extendable.
This conjecture concerns matching extendability and follows discussion of the classification of -regular quadrangulations on the Klein bottle. The status of the claim is not resolved in the supplied source.
References
2 papers in this index state this conjecture (2024–2025). The statement above is taken from the most recent of them; the others are arXiv:2412.19074.
Source: Shohei Koizumi and Yusuke Suzuki, “Connectivity and matching extendability of optimal 1-embedded graphs on the torus”, arXiv:2501.02726 (2025).
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.