Planar Barnette-type conjecture for sink-regular bipartite digraphs
Planar Barnette-type conjecture for sink-regular bipartite digraphs
Let be a sink-regular -bipartite digraph that is planar, and let be disjoint bases of . A rounded -factor is an object with associated set .
Barnette-type conjecture. There exists a rounded -factor such that
and is connected.
If true, this conjecture implies that every planar digraph whose dicuts have size at least three has three disjoint dijoins. Its resemblance to Barnette's conjecture for planar cubic bipartite graphs is noted in the source.
Sources & referencesView supporting material
Primary source
Ahmad Abdi, Gérard Cornuéjols and Michael Zlatin, “On packing dijoins in digraphs and weighted digraphs”, arXiv:2202.00392 (2023).
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.