When all directed cycles have length three

2024/10/16 by Seymour, Paul · 1 citation
#05C20 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2410.13008

Abstract

We give a construction to build all digraphs with the property that every directed cycle has length three.

Cited by

• The structure of Δ(1, 2, 2)-free tournaments

Related

• A note on directed 4-cycles in digraphs
• Disjoint cycles with length constraints in digraphs of large connectivity or minimum degree
• Note on Long Directed Cycles in Eulerian Digraphs
• Cycles of Length 4 or 8 in Graphs with Diameter 2 and Minimum Degree at Least 3
• Outdegree conditions forcing short cycles in digraphs