A note on extremal digraphs containing at most \(t\) walks of length \(k\) with the same endpoints
From MaRDI portal
Publication:2115146
DOI10.1007/s00373-021-02449-9zbMath1484.05105arXiv2106.00212OpenAlexW4221041754MaRDI QIDQ2115146
Publication date: 15 March 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.00212
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Digraphs that have at most one walk of a given length with the same endpoints
- On the 0-1 matrices 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
- 0-1 matrices whose squares have bounded entries
- Extremal problems for directed graphs
- 0–1 matrices whose k-th powers have bounded entries
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A note on extremal digraphs containing at most \(t\) walks of length \(k\) with the same endpoints
