Cycles in dense digraphs

DOI10.1007/S00493-008-2331-ZzbMath1174.05049arXivmath/0702147OpenAlexW1987195239MaRDI QIDQ949775

Maria Chudnovsky, Blair D. Sullivan, P. D. Seymour

Publication date: 21 October 2008

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

cyclesCacetta-Häggkvist conjecturefour function theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (15)

Unnamed Item ⋮ Packing arc-disjoint cycles in tournaments ⋮ Extremal results on feedback arc sets in digraphs ⋮ Packing arc-disjoint cycles in oriented graphs ⋮ On Sullivan's conjecture on cycles in 4-free and 5-free digraphs ⋮ Destroying cycles in digraphs ⋮ Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs ⋮ Directed Graphs Without Short Cycles ⋮ On the structure of oriented graphs and digraphs with forbidden tournaments or cycles ⋮ Gallai colorings and domination in multipartite digraphs ⋮ Counting flags in triangle-free digraphs ⋮ A new bound for a particular case of the Caccetta-Häggkvist conjecture ⋮ HEIGHTS ON THE FINITE PROJECTIVE LINE ⋮ 3-free strong digraphs with the maximum size ⋮ Packing Arc-Disjoint Cycles in Tournaments

Cites Work

• Unnamed Item
• On directed triangles in digraphs
• An inequality for the weights of two families of sets, their unions and intersections

This page was built for publication: Cycles in dense digraphs