Subdivisions of transitive tournaments

DOI10.1006/eujc.2000.0406zbMath0965.05049OpenAlexW2169373695MaRDI QIDQ1590220

Alexander D. Scott

Publication date: 2 August 2001

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.2000.0406

zbMATH Keywords

subdivisionTurán graphtransitive tournamentextremal digraphs

Mathematics Subject Classification ID

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

Related Items

Extremal digraphs avoiding distinct walks of length 3 with the same endpoints ⋮ Ramsey number of 1-subdivisions of transitive tournaments ⋮ Complete directed minors and chromatic number ⋮ Subdivisions of digraphs in tournaments ⋮ A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints ⋮ Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints ⋮ Extremal digraphs avoiding an orientation of \(C_4\)

Cites Work

• Unnamed Item
• Extremal digraph results for topological complete subgraphs
• Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Highly linked graphs
• Extremal Graphs without Large Forbidden Subgraphs
• Topological cliques in graphs II