A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
From MaRDI portal
Publication:1999736
Abstract: Let and be positive integers. We determine the maximum size of digraphs of order n that avoid distinct walks of length k with the same endpoints. We also characterize the extremal digraphs attaining this maximum number when .
Recommendations
- Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints
- Extremal digraphs avoiding distinct walks of length 3 with the same endpoints
- A note on extremal digraphs containing at most \(t\) walks of length \(k\) with the same endpoints
- Extremal digraphs avoiding distinct walks of length 4 with the same endpoints
- scientific article; zbMATH DE number 1355278
- A Turán-type problem on distances in graphs
- Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths
- Digraphs that have at most one walk of a given length with the same endpoints
- Another extremal problem for Turan graphs
- On a problem of P. Turan concerning graphs
Cites work
- 0-1 matrices with zero trace whose squares are 0-1 matrices
- A Bound on the Number of Edges in Graphs Without an Even Cycle
- A generalization of Turan's theorem to directed graphs
- A note on the Turán function of even cycles
- Algorithmic Solution of Extremal Digraph Problems
- Cycles of even length in graphs
- Digraphs that have at most one walk of a given length with the same endpoints
- Extension of Turan's and Brooks' Theorems and New Notions of Stability and Coloring in Digraphs
- Extremal graphs without 4-cycles
- Extremal problems for directed graphs
- scientific article; zbMATH DE number 1943959 (Why is no real title available?)
- scientific article; zbMATH DE number 863492 (Why is no real title available?)
- scientific article; zbMATH DE number 3262986 (Why is no real title available?)
- scientific article; zbMATH DE number 3333210 (Why is no real title available?)
- Matrix theory
- New asymptotics for bipartite Turán numbers
- On a conjecture of Erdős and Simonovits: even cycles
- On the 0-1 matrices whose squares are 0-1 matrices
- On the theory of graphs
- On the Turán number for the hexagon
- Sidon sets and graphs without 4-cycles
- Some new results in extremal graph theory
- Subdivisions of transitive tournaments
- The history of degenerate (bipartite) extremal graph problems
- Über ein Problem von K. Zarankiewicz
Cited in
(18)- 0-1 matrices with zero trace whose squares are 0-1 matrices
- Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints
- Extremal digraphs avoiding an orientation of the diamond
- A note on extremal digraphs containing at most \(t\) walks of length \(k\) with the same endpoints
- Turán number of 3-free strong digraphs with out-degree restriction
- Extremal digraphs avoiding distinct walks of length 3 with the same endpoints
- Extremal digraphs avoiding distinct walks of length 4 with the same endpoints
- On k-idempotent 0-1 matrices
- 0-1 matrices whose squares have bounded entries
- Extremal digraphs avoiding an orientation of \(C_4\)
- Turán problems for \(k\)-geodetic digraphs
- The Turán number of directed paths and oriented cycles
- Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths
- 0-1 matrices whose \(k\)-th powers have bounded entries
- Digraphs that have at most one walk of a given length with the same endpoints
- Extremal oriented graphs avoiding 1-subdivision of an in-star
- Turán number of strong digraphs forbidden at least two triangles
- Extremal digraphs containing at most t paths of length 2 with the same endpoints
This page was built for publication: A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1999736)
