Lovász–Woodall conjecture on cycles through prescribed independent edges
Let be a -connected graph, and let be a set of independent edges of . Here, independent edges have no common endpoint.
Lovász–Woodall conjecture. If is even or is connected, then contains a cycle containing every edge in .
This conjecture is part of the classical problem of finding cycles through prescribed edges. The supplied source does not state whether it has been resolved.
References
2 papers in this index state this conjecture (2017–2018). The statement above is taken from the most recent of them; the others are arXiv:1707.07291.
Source: Paul Knappe and Max Pitz, “Circuits through prescribed edges”, arXiv:1810.09323 (2018).
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.