Extremal results on feedback arc sets in digraphs
From MaRDI portal
Publication:6119220
DOI10.1002/rsa.21179arXiv2204.01938MaRDI QIDQ6119220
Jacob Fox, Nitya Mani, Zoe M. Himwich
Publication date: 29 February 2024
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.01938
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximate version of Sidorenko's conjecture
- A fast and effective heuristic for the feedback arc set problem
- Supersaturated graphs and hypergraphs
- On the maximum cardinality of a consistent set of arcs in a random tournament
- Retiming synchronous circuitry
- Cycles in dense digraphs
- On the number of subgraphs of prescribed type of graphs with a given number of edges
- Optimally ranking unrankable tournaments
- The Moore bound for irregular graphs
- Approximating minimum feedback sets and multicuts in directed graphs
- Rational exponents in extremal graph theory
- A new upper bound on extremal number of even cycles
- Finite reflection groups and graph norms
- A correlation inequality for bipartite graphs
- Two approaches to Sidorenko’s conjecture
- Quasi-Random Oriented Graphs
- Subgraphs of Weakly Quasi-Random Oriented Graphs
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Quasi-random tournaments
- Sidorenko's conjecture for blow-ups
- The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
- Directed Graphs Without Short Cycles
- Tournament Ranking with Expected Profit in Polynomial Time
- Tight Bounds for the Maximum Acyclic Subgraph Problem
- The Fourth Moment Method
- Some advances on Sidorenko's conjecture
- A Note on Even Cycles and Quasirandom Tournaments
- Ranking Tournaments
- On Sets of Consistent Arcs in a Tournament
- Optimal ranking of tournaments
- Quasi-random graphs
- Graph norms and Sidorenko's conjecture
This page was built for publication: Extremal results on feedback arc sets in digraphs
