Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints

DOI10.1007/s10878-021-00718-0zbMath1464.05162OpenAlexW3133592979MaRDI QIDQ2025066

Zhenhua Lyu

Publication date: 11 May 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00718-0

zbMATH Keywords

digraphtournamentwalkTurán problem

Mathematics Subject Classification ID

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

Related Items

Turán number of 3-free strong digraphs with out-degree restriction, The Turán number of directed paths and oriented cycles, 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

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• On the 0-1 matrices whose squares are 0-1 matrices
• A generalization of Turan's theorem to directed graphs
• Subdivisions of transitive tournaments
• A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
• Extremal digraphs avoiding distinct walks of length 4 with the same endpoints
• Extremal digraphs avoiding an orientation of \(C_4\)
• Extremal problems for directed graphs
• Extension of Turan's and Brooks' Theorems and New Notions of Stability and Coloring in Digraphs
• Über ein Problem von K. Zarankiewicz
• Algorithmic Solution of Extremal Digraph Problems
• 0–1 matrices whose k-th powers have bounded entries
• The Theory of Round Robin Tournaments
• On the theory of graphs