MathDBMazzuoccolo's bipartite-complement conjecture for cubic graphs
Mazzuoccolo's bipartite-complement conjecture for cubic graphs
Let be a bridgeless cubic graph. Mazzuoccolo's conjecture. There exist two perfect matchings such that the graph obtained by deleting their union, , is bipartite. The source presents this as a weakening of the preceding perfect-matching conjectures; no resolution is supplied here.
Sources & referencesView supporting material
Primary source
Paulo Magalhães Júnior and Antonio Kelson Silva, “On some perfect matching conjectures in infinite, cubic, bridgeless graphs”, arXiv:2607.29511 (2026).
Additional references
5 papers in this index state this conjecture (2018–2026). The statement above is taken from the most recent of them; the others are arXiv:2309.06944, arXiv:2204.10021, arXiv:2110.13684, arXiv:1811.08363.
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
Sign in to submit a solution.
No solutions have been posted yet.