3-free strong digraphs with the maximum size

DOI10.1007/s00373-021-02373-yzbMath1479.05128OpenAlexW3184284150MaRDI QIDQ2053715

Bin Chen, An Chang

Publication date: 30 November 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02373-y

zbMATH Keywords

maximum sizeminimum out-degreestrong digraph3-free digraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)

Related Items

Turán number of 3-free strong digraphs with out-degree restriction

Cites Work

• Unnamed Item
• Destroying cycles in digraphs
• A new bound for a particular case of the Caccetta-Häggkvist conjecture
• Cycles in dense digraphs
• Minimum feedback arc set of \(m\)-free digraphs
• On the Chudnovsky-Seymour-Sullivan conjecture on cycles in triangle-free digraphs
• Girth in digraphs
• Digraphs
• Counting flags in triangle-free digraphs