On Sullivan's conjecture on cycles in 4-free and 5-free digraphs

DOI10.1007/s10114-012-1538-5zbMath1260.05069OpenAlexW2399464585WikidataQ123357907 ScholiaQ123357907MaRDI QIDQ1942646

Hao Liang, Jun-Ming Xu

Publication date: 19 March 2013

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-012-1538-5

zbMATH Keywords

digraphdirected cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

4-Free Strong Digraphs with the Maximum Size

Cites Work

• Destroying cycles in digraphs
• Cycles in dense digraphs
• On directed triangles in digraphs
• Directed triangles in digraphs
• Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture
• On the Chudnovsky-Seymour-Sullivan conjecture on cycles in triangle-free digraphs
• Theory and Application of Graphs
• Counting flags in triangle-free digraphs

This page was built for publication: On Sullivan's conjecture on cycles in 4-free and 5-free digraphs