Turán problems for \(k\)-geodetic digraphs

DOI10.1007/s00373-023-02619-xOpenAlexW4321611712MaRDI QIDQ2689115

Grahame Erskine, Nika Salia, James Tuite

Publication date: 9 March 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

digraphTurán problemextremal\(k\)-geodeticstrong-connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximum number of five-cycles in a triangle-free graph
• Pentagons vs. triangles
• On the 0-1 matrices whose squares are 0-1 matrices
• Digraphs on permutations
• On diregular digraphs with degree two and excess two
• Explicit construction of graphs with an arbitrary large girth and of large size
• On the number of pentagons in triangle-free graphs
• A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
• Extremal digraphs avoiding distinct walks of length 3 with the same endpoints
• Extremal digraphs avoiding distinct walks of length 4 with the same endpoints
• Moore graphs and beyond: a survey of the degree/diameter problem
• The Maximum Number of Triangles in C_2k+1-Free Graphs
• Cycles in digraphs– a survey
• Girth in digraphs
• Extensions of Turán's theorem on graphs
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: Turán problems for \(k\)-geodetic digraphs