On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity

DOI10.1016/j.ejc.2013.05.023zbMath1296.05084OpenAlexW1965993741WikidataQ123200635 ScholiaQ123200635MaRDI QIDQ2509724

Anna S. Lladó

Publication date: 29 July 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2013.05.023

zbMATH Keywords

Caccetta-Häggkvist conjectureisoperimetric method of Hamidoune

Mathematics Subject Classification ID

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

Related Items (3)

On Seymour's second neighborhood conjecture of \(m\)-free digraphs ⋮ A note on Seymour's second neighborhood conjecture ⋮ Extending some results on the second neighborhood conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some additive applications of the isoperimetric approach
• An application of connectivity theory in graphs to factorizations of elements in groups
• Minimum order of loop networks of given degree and girth
• Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
• Remarks on the second neighborhood problem
• On Iterated Image Size for Point-Symmetric Relations
• On minimal regular digraphs with given girth
• The isoperimetric method

This page was built for publication: On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity