Bang–Jensen–Thomassé's arc-connectivity conjecture for supereulerian digraphs

About 7 years old · traced to

Let DD be a digraph. Write λ(D)\lambda(D) for its arc-connectivity and α(D)\alpha(D) for its independence number. A digraph is supereulerian if it has a spanning eulerian subdigraph.

Bang–Jensen–Thomassé's conjecture. Every digraph DD with λ(D)≥α(D)\lambda(D)\geq\alpha(D) is supereulerian.

This conjecture generalizes Camion's theorem and is open even for digraphs of independence number 22, although it has been verified for several classes of digraphs.

References

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

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.