Spanning eulerian subdigraphs in semicomplete digraphs
Abstract
A digraph is eulerian if it is connected and every vertex has its indegree equal to its outdegree. Having a spanning eulerian subdigraph is thus a weakening of having a hamiltonian cycle. In this paper, we first characterize the pairs $(D,a)$ of a semicomplete digraph $D$ and an arc $a$ such that $D$ has a spanning eulerian subdigraph containing $a$. In particular, we show that if $D$ is $2$arcstrong, then every arc is contained in a spanning eulerian subdigraph. We then characterize the pairs $(D,a)$ of a semicomplete digraph $D$ and an arc $a$ such that $D$ has a spanning eulerian subdigraph avoiding $a$. In particular, we prove that every $2$arcstrong semicomplete digraph has a spanning eulerian subdigraph avoiding any prescribed arc. We also prove the existence of a (minimum) function $f(k)$ such that every $f(k)$arcstrong semicomplete digraph contains a spanning eulerian subdigraph avoiding any prescribed set of $k$ arcs: we prove $f(k)\leq (k+1)^2/4 +1$, conjecture $f(k)=k+1$ and establish this conjecture for $k\leq 3$ and when the $k$ arcs that we delete form a forest of stars. A digraph $D$ is eulerianconnected if for any two distinct vertices $x,y$, the digraph $D$ has a spanning $(x,y)$trail. We prove that every $2$arcstrong semicomplete digraph is eulerianconnected. All our results may be seen as arc analogues of wellknown results on hamiltonian cycles in semicomplete digraphs.
 Publication:

arXiv eprints
 Pub Date:
 May 2019
 DOI:
 10.48550/arXiv.1905.11019
 arXiv:
 arXiv:1905.11019
 Bibcode:
 2019arXiv190511019B
 Keywords:

 Computer Science  Discrete Mathematics;
 Mathematics  Combinatorics