← All problems

3-extendability conjecture for optimal 1-embedded graphs on the Klein bottle

1 year old · documented by

Let GG be an 88-regular optimal 11-embedded graph on the Klein bottle. A graph is 33-extendable if every matching of size 33 extends to a perfect matching.

3-extendability conjecture. Every 88-regular optimal 11-embedded graph GG on the Klein bottle is 33-extendable.

This conjecture concerns matching extendability and follows discussion of the classification of 44-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

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.