The extremal sizes of arc-maximal \((k, \ell)\)-digraphs

DOI10.1007/s00373-022-02468-0zbMath1485.05073OpenAlexW4220790324MaRDI QIDQ2117539

Hong-Jian Lai, Murong Xu, Yingzhi Tian, Li Qiong Xu

Publication date: 21 March 2022

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

Full work available at URL: https://doi.org/10.1007/s00373-022-02468-0

zbMATH Keywords

\((k, \ell)\)-digraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites Work

• On the lower bound of \(k\)-maximal digraphs
• An edge extremal result for subcohesion
• On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Onk-Maximal Strength Digraphs
• Edge‐maximal (k, i)‐graphs
• The size of strength‐maximal graphs
• Digraphs
• k-Components, Clusters and Slicings in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The extremal sizes of arc-maximal \((k, \ell)\)-digraphs