Extremal digraphs avoiding distinct walks of length 4 with the same endpoints

DOI10.7151/dmgt.2321zbMath1497.05106OpenAlexW3023262794MaRDI QIDQ2151226

Zhenhua Lyu

Publication date: 1 July 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2321

zbMATH Keywords

digraphwalkTurán problemstransitive tournament

Mathematics Subject Classification ID

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

Related Items (3)

Extremal digraphs avoiding distinct walks of length 3 with the same endpoints ⋮ Turán problems for \(k\)-geodetic digraphs ⋮ Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints

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
• Extremal problems for directed graphs
• 0–1 matrices whose k-th powers have bounded entries
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal digraphs avoiding distinct walks of length 4 with the same endpoints