ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk 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 (k+1)(k+1)-arc-strong if deleting fewer than k+1k+1 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 (k+1)(k+1)-arc-strong semicomplete digraph DD has a spanning eulerian subdigraph that avoids any prescribed set of kk arcs.

The paper proves the existence of a finite connectivity bound, with an upper bound of (k+1)2/4+1(k+1)^2/4+1, while a degree-based obstruction gives the lower bound k+1k+1. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.