Spanning eulerian subdigraphs in semicomplete digraphs

05/27/2019
by   Jørgen Bang-Jensen, et al.
0

A digraph is eulerian if it is connected and every vertex has its in-degree equal to its out-degree. 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-arc-strong, 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-arc-strong 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)-arc-strong semicomplete digraph contains a spanning eulerian subdigraph avoiding any prescribed set of k arcs: we prove f(k)≤ (k+1)^2/4 +1, conjecture f(k)=k+1 and establish this conjecture for k≤ 3 and when the k arcs that we delete form a forest of stars. A digraph D is eulerian-connected if for any two distinct vertices x,y, the digraph D has a spanning (x,y)-trail. We prove that every 2-arc-strong semicomplete digraph is eulerian-connected. All our results may be seen as arc analogues of well-known results on hamiltonian cycles in semicomplete digraphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2020

Non-separating spanning trees and out-branchings in digraphsof independence number 2

A subgraph H= (V, F) of a graph G= (V,E) is non-separating if G-F, that ...
research
09/14/2017

Spanning trees with few branch vertices

A branch vertex in a tree is a vertex of degree at least three. We prove...
research
04/06/2020

Spanning analysis of stock market anomalies under Prospect Stochastic Dominance

We develop and implement methods for determining whether introducing new...
research
05/23/2021

Every Steiner triple system contains an almost spanning d-ary hypertree

In this paper we make a partial progress on the following conjecture: fo...
research
03/22/2022

Gradient Vector Fields of Discrete Morse Functions are Minimum Spanning Forests

In this paper, we prove that discrete Morse functions are equivalent to ...
research
10/06/2022

A Toolkit for Robust Thresholds

Consider a host (hyper)graph G which contains a spanning structure due t...
research
07/08/2020

Superpixel Segmentation using Dynamic and Iterative Spanning Forest

As constituent parts of image objects, superpixels can improve several h...

Please sign up or login with your details

Forgot password? Click here to reset