Subdivisions of transitive tournaments (Q1590220): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:18, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Subdivisions of transitive tournaments |
scientific article |
Statements
Subdivisions of transitive tournaments (English)
0 references
2 August 2001
0 references
A subdivision of a digraph is a digraph obtained by replacing arcs by directed paths (in the same direction as the arcs). It is proved that, for \(r\geq 2\) and \(n\geq n(r)\), every digraph with \(n\) vertices and more arcs than the \(r\)-partite Turán graph \(T(r,n)\), contains a subdivision of the transitive tournament on \(r+1\) vertices. Moreover, the extremal digraphs are the orientations of \(T(r,n)\) induced by orderings of the vertex classes.
0 references
subdivision
0 references
Turán graph
0 references
transitive tournament
0 references
extremal digraphs
0 references