A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints

DOI10.1016/j.disc.2019.02.002zbMath1414.05133arXiv1608.06170OpenAlexW2962779024MaRDI QIDQ1999736

Pu Qiao, Zhenhua Lyu, Ze-Jun Huang

Publication date: 27 June 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.06170

zbMATH Keywords

digraphwalktransitive tournamentTurán problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (13)

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 ⋮ Turán problems for \(k\)-geodetic digraphs ⋮ The Turán number of directed paths and oriented cycles ⋮ 0–1 matrices whose k-th powers have bounded entries ⋮ 0-1 matrices whose squares have bounded entries ⋮ 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 ⋮ Extremal digraphs avoiding an orientation of \(C_4\) ⋮ A note on extremal digraphs containing at most \(t\) walks of length \(k\) with the same endpoints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sidon sets and graphs without 4-cycles
• Digraphs that have at most one walk of a given length with the same endpoints
• Extremal graphs without 4-cycles
• On the 0-1 matrices whose squares are 0-1 matrices
• A generalization of Turan's theorem to directed graphs
• Subdivisions of transitive tournaments
• 0-1 matrices with zero trace whose squares are 0-1 matrices
• Cycles of even length in graphs
• New asymptotics for bipartite Turán numbers
• On a conjecture of Erdős and Simonovits: even cycles
• On the Turán number for the hexagon
• Extremal problems for directed graphs
• A note on the Turán function of even cycles
• Extension of Turan's and Brooks' Theorems and New Notions of Stability and Coloring in Digraphs
• Some new results in extremal graph theory
• Über ein Problem von K. Zarankiewicz
• Algorithmic Solution of Extremal Digraph Problems
• A Bound on the Number of Edges in Graphs Without an Even Cycle
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On the theory of graphs

This page was built for publication: A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints