Bang–Jensen–Thomassé's arc-connectivity conjecture for supereulerian digraphs
Bang–Jensen–Thomassé's arc-connectivity conjecture for supereulerian digraphs
Let be a digraph. Write for its arc-connectivity and for its independence number. A digraph is supereulerian if it has a spanning eulerian subdigraph.
Bang–Jensen–Thomassé's conjecture. Every digraph with is supereulerian.
This conjecture generalizes Camion's theorem and is open even for digraphs of independence number , although it has been verified for several classes of digraphs.
Sources & referencesView supporting material
Primary source
Jørgen Bang-Jensen, Hugues Depres and Anders Yeo, “Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments”, arXiv:1907.00853 (2019).
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.