Gutin–Yeo weighted Max-Cut conjecture
This entry tracks Gutin–Yeo weighted Max-Cut conjecture.
It settles a natural threshold on a substantial subclass while improving the best general bound.
Latest development
The paper obtains 15/19 generally for triangle-free subcubic graphs, 47/59 at odd girth at least seven, and 4/5 at odd girth at least nine.
Editorial caveat
The 4/5 conjecture for all triangle-free subcubic graphs remains open.
References
- Weighted Max Cut in Subcubic Graphs — arXiv — Will Hausmann
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.