On directed triangles in digraphs

zbMath1157.05311MaRDI QIDQ1010591

Peter Hamburger, Penny E. Haxell, Alexandr V. Kostochka

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/129672

zbMATH Keywords

digraphindegreeoutdegreeminimum outdegreederected cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (12)

On Seymour's second neighborhood conjecture of \(m\)-free digraphs ⋮ Short rainbow cycles in graphs and matroids ⋮ On Sullivan's conjecture on cycles in 4-free and 5-free digraphs ⋮ Destroying cycles in digraphs ⋮ Cycles in dense digraphs ⋮ On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament ⋮ Counting flags in triangle-free digraphs ⋮ Cycles of given length in oriented graphs ⋮ Counting paths in digraphs ⋮ A new bound for a particular case of the Caccetta-Häggkvist conjecture ⋮ Short cycles in oriented graphs ⋮ On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs

This page was built for publication: On directed triangles in digraphs