The spanning eulerian subdigraph avoidance conjecture for semicomplete digraphs
Statement
Let be a non-negative integer. A semicomplete digraph is a directed graph in which every pair of distinct vertices is joined by at least one arc. A digraph is -arc-strong if deleting fewer than arcs leaves it strongly connected. A spanning eulerian subdigraph is a subdigraph containing every vertex in which each vertex has equal indegree and outdegree.
Spanning eulerian subdigraph avoidance conjecture. Every -arc-strong semicomplete digraph has a spanning eulerian subdigraph that avoids any prescribed set of arcs.
The paper proves the existence of a finite connectivity bound, with an upper bound of , while a degree-based obstruction gives the lower bound . The conjecture that the lower bound always suffices remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.