Extremal digraphs avoiding an orientation of the diamond
From MaRDI portal
Publication:2042213
DOI10.1007/s00373-021-02324-7zbMath1469.05089OpenAlexW3162423113MaRDI QIDQ2042213
Publication date: 28 July 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-021-02324-7
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
Extremal digraphs avoiding distinct walks of length 3 with the same endpoints ⋮ The Turán number of directed paths and oriented cycles
Cites Work
- Digraphs that have at most one walk of a given length with the same endpoints
- 0-1 matrices with zero trace whose squares are 0-1 matrices
- A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
- Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints
- Extremal digraphs avoiding an orientation of \(C_4\)
- Extremal problems for directed graphs
- 0–1 matrices whose k-th powers have bounded entries
- On the theory of graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Extremal digraphs avoiding an orientation of the diamond
