3-free strong digraphs with the maximum size

DOI10.1007/S00373-021-02373-YMaRDI QIDQ2053715zbMATH OpenOpenAlexFDO

Authors 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

3-free digraphmaximum sizeminimum out-degreestrong digraph

Mathematics Subject Classification ID

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

Recommendations

• Turán number of 3-free strong digraphs with out-degree restriction
• On directed triangles in digraphs
• 4-Free Strong Digraphs with the Maximum Size
• On Sullivan's conjecture on cycles in 4-free and 5-free digraphs
• Minimum feedback arc set of \(m\)-free digraphs

Cites work

• A new bound for a particular case of the Caccetta-Häggkvist conjecture
• Cycles in dense digraphs
• Destroying cycles in digraphs
• Digraphs
• Girth in digraphs
• scientific article; zbMATH DE number 3630786 (Why is no real title available?)
• Minimum feedback arc set of \(m\)-free digraphs
• On the Chudnovsky-Seymour-Sullivan conjecture on cycles in triangle-free digraphs

Cited in

(6)

• On Sullivan's conjecture on cycles in 4-free and 5-free digraphs
• Turán number of 3-free strong digraphs with out-degree restriction
• Minimum feedback arc set of \(m\)-free digraphs
• 4-Free Strong Digraphs with the Maximum Size
• Extremal oriented graphs avoiding 1-subdivision of an in-star
• Turán number of strong digraphs forbidden at least two triangles

This page was built for publication: 3-free strong digraphs with the maximum size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053715)