Directed Graphs Without Short Cycles

DOI10.1017/S0963548309990460zbMath1209.05106arXiv0809.4690OpenAlexW2207384628MaRDI QIDQ3557536

Peter Keevash, Jacob Fox, Benjamin Sudakov

Publication date: 23 April 2010

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0809.4690

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Extremal results on feedback arc sets in digraphs ⋮ Destroying cycles in digraphs ⋮ Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Retiming synchronous circuitry
• Cycles in dense digraphs
• Blow-up lemma
• Almost given length cycles in digraphs
• The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
• Ranking Tournaments
• Testing subgraphs in directed graphs

This page was built for publication: Directed Graphs Without Short Cycles