Esperet–Mazzuoccolo–Tarsi conjecture on 2-quasi-bisections of cubic graphs
This entry tracks Esperet–Mazzuoccolo–Tarsi conjecture on 2-quasi-bisections of cubic graphs.
It enlarges the structural evidence for the conjecture for all cubic graphs.
Latest development
The verified class allows up to two odd circuit components, extending the prior tree-plus-circuit case.
Editorial caveat
No general proof is claimed.
References
- Quasi-Bisections of Cubic Graphs with Tree and Circuit Decompositions — arXiv — Xixiong Tang, Rong-Xia Hao, Yilun Luo, Cun-Quan Zhang
Source: arXiv
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.