Proof of the Caccetta-Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number two

DOI10.1016/j.disc.2013.03.019zbMath1408.05101OpenAlexW1989846519WikidataQ123235666 ScholiaQ123235666MaRDI QIDQ389212

Nicolas Lichiardopol

Publication date: 20 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.03.019

zbMATH Keywords

independence numberoriented graphCaccetta-Häggkvist conjecture

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Short rainbow cycles in graphs and matroids ⋮ Proof of the Caccetta-Häggkvist conjecture for digraphs with small independence number ⋮ On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs

Cites Work

• A new bound for a particular case of the Caccetta-Häggkvist conjecture
• On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs
• Counting flags in triangle-free digraphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Proof of the Caccetta-Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number two