The extremal sizes of arc-maximal (k, )-digraphs
From MaRDI portal
Publication:2117539
DOI10.1007/S00373-022-02468-0zbMATH Open1485.05073OpenAlexW4220790324MaRDI QIDQ2117539FDOQ2117539
Authors: Hong-Jian Lai, Yingzhi Tian, Murong Xu, Liqiong 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
Recommendations
- scientific article; zbMATH DE number 3842616
- On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees
- On the lower bound of \(k\)-maximal digraphs
- On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs
- On \((k,d)\)-maximum indexable graphs and \((k,d)\)-maximum arithmetic graphs
- On the number of arcs in primitive digraphs with large exponents
- On the maximum size of some \((k,r)\)-arcs in PG\((2,q)\)
- scientific article; zbMATH DE number 7267378
- Maximum size of digraphs with some parameters
- On \(k\)-maximal strength digraphs
Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Connectivity (05C40)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Digraphs
- Title not available (Why is that?)
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- On the lower bound of \(k\)-maximal digraphs
- On \(k\)-maximal strength digraphs
- The size of strength‐maximal graphs
- Title not available (Why is that?)
- k-Components, Clusters and Slicings in Graphs
- An edge extremal result for subcohesion
- On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs
- Edge‐maximal (k, i)‐graphs
Cited In (4)
This page was built for publication: The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117539)
