Subdivisions of transitive tournaments (Q1590220): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/eujc.2000.0406 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2169373695 / rank | |||
Normal rank | |||
Revision as of 20:36, 19 March 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
