Abstract
A basic result in Ramsey theory states that any tournament contains a "large" transitive subgraph. Since transitive tournaments contain only transitive subgraphs, it is natural to ask which subgraphs must appear in any large tournament that is "far" from being transitive. One result of this type was obtained by Fox and Sudakov who characterized the tournaments that appear in any tournament that is ε-far from being transitive. Another result of this type was obtained by Berger et al. who characterized the tournaments that appear in any tournament that cannot be partitioned into a bounded number of transitive sets.In this paper we consider the common generalization of the above two results, namely the tournaments that must appear in any tournament that is ε-far from being the union of a bounded number of transitive sets. Our main result is a precise characterization of these tournaments.
| Original language | English |
|---|---|
| Pages (from-to) | 191-207 |
| Number of pages | 17 |
| Journal | Journal of Combinatorial Theory. Series B |
| Volume | 116 |
| DOIs | |
| State | Published - Jan 2016 |
Bibliographical note
Publisher Copyright:© 2015 Elsevier Inc.
Keywords
- Coloring
- Tournament
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics