# Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs

@article{Huang2013LargeFA, title={Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs}, author={Hao-wei Huang and Jie Ma and Asaf Shapira and Benny Sudakov and Raphael Yuster}, journal={Combinatorics, Probability and Computing}, year={2013}, volume={22}, pages={859 - 873} }

A minimum feedback arc set of a directed graph G is a smallest set of arcs whose removal makes G acyclic. Its cardinality is denoted by β(G). We show that a simple Eulerian digraph with n vertices and m arcs has β(G) ≥ m2/2n2+m/2n, and this bound is optimal for infinitely many m, n. Using this result we prove that a simple Eulerian digraph contains a cycle of length at most 6n2/m, and has an Eulerian subgraph with minimum degree at least m2/24n3. Both estimates are tight up to a constant factor…

## 10 Citations

### Long directed paths in Eulerian digraphs

- Mathematics
- 2021

An old conjecture of Bollobás and Scott asserts that every Eulerian directed graph with average degree d contains a directed cycle of length at least Ω(d). The best known lower bound for this problem…

### Exact Localisations of Feedback Sets

- MathematicsTheory of Computing Systems
- 2017

The notion of the essential minor and isolated cycles, which yield a priori problem size reductions and in the special case of so called resolvable graphs an exact solution in 𝓞(|V||E|3)$\mathcal {O}(| V||E |^{3})$ is introduced and weighted versions of the FASP and FVSP possess a Bellman decomposition.

### Note on Long Paths in Eulerian Digraphs

- MathematicsElectron. J. Comb.
- 2021

This short note shows how to use methods from [Knierim, Larcher, Martinsson, Noever, JCTB 148:125--148] to find paths of length d/(\log d+1) in Eulerian digraphs with average degree d, improving the recent result of $\Omega(d^{1/2+1/40})$.

### Minimum edge cuts of distance-regular and strongly regular digraphs

- Mathematics
- 2017

In this paper, we show that the edge connectivity of a distance-regular digraph $\Gamma$ with valency $k$ is $k$ and for $k>2$, any minimum edge cut of $\Gamma$ is the set of all edges going into (or…

### Path Decompositions of Random Directed Graphs

- MathematicsTrends in Mathematics
- 2021

We consider the problem of decomposing the edges of a directed graph into as few paths as possible. There is a natural lower bound for the number of paths needed in an edge decomposition of a…

### Feedback Arc Set Problem and NP-Hardness of Minimum Recurrent Configuration Problem of Chip-Firing Game on Directed Graphs

- Mathematics, Computer Science
- 2013

This paper points out a close relationship between MINREC and the minimum feedback arc set (MINFAS) problem on Eulerian directed graphs, and proves that both problems are NP-hard.

### Decomposing tournaments into paths

- MathematicsElectron. Notes Discret. Math.
- 2017

This work considers a generalisation of Kelly's conjecture, which is due Alspach, Mason, and Pullman from 1976, and proves many of the cases of the conjecture.

### Long cycles, heavy cycles and cycle decompositions in digraphs

- MathematicsJ. Comb. Theory, Ser. B
- 2021

### A study on Euler Graph and it’s applications

- Computer Science
- 2017

Main objective of this paper to study Euler graph and it’s various aspects in the authors' real world by using techniques found in a relatively new area of mathematics.

## References

SHOWING 1-10 OF 19 REFERENCES

### Directed Graphs Without Short Cycles

- MathematicsCombinatorics, Probability and Computing
- 2009

It is proved that every directed graph whose shortest directed cycle has length at least r ≥ 4 satisfies β(G) ≤ cγ(G)/r2, where c is an absolute constant.

### Cycles in dense digraphs

- MathematicsComb.
- 2008

It is proved that in general β(G) ≤ γ(G), and that in two special cases: when V (G) is the union of two cliques when the vertices of G can be arranged in a circle such that if distinct u, v, w are in clockwise order and uw is a (directed) edge, then so are both uv, vw.

### A Proof of a Conjecture of Bondy Concerning Paths in Weighted Digraphs

- MathematicsJ. Comb. Theory, Ser. B
- 1996

Our aim in this note is to prove a conjecture of Bondy, extending a classical theorem of Dirac to edge-weighted digraphs: if every vertex has out-weight at least 1 then the digraph contains a path of…

### The Caccetta-Haggkvist conjecture and additive number theory

- Mathematics
- 2006

The Caccetta-Haggkvist conjecture states that if G is a finite directed graph with at least n/k edges going out of each vertex, then G contains a directed cycle of length at most k. Hamidoune used…

### Ranking Tournaments

- MathematicsSIAM J. Discret. Math.
- 2006

It is shown that the feedback arc set problem for tournaments is NP-hard under randomized reductions, which settles a conjecture of Bang-Jensen and Thomassen.

### The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments

- MathematicsCombinatorics, Probability and Computing
- 2006

It is proved that the minimum feedback arc set problem is NP-hard for tournaments.

### Retiming synchronous circuitry

- Computer ScienceAlgorithmica
- 2005

This paper describes a circuit transformation calledretiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuit…

### A Summary of Results and Problems Related to the Caccetta-Haggkvist Conjecture

- Mathematics
- 2006

This paper is an attempt to survey the current state of our knowledge on the Caccetta-Häggkvist conjecture and related questions. In January 2006 there was a workshop hosted by the American Institute…

### The logical design of operating systems

- Business
- 1987

The logical design of operating systems is discussed in more detail in the second part of this monograph on the design of mobile operating systems.