Journal article icon

Journal article

Large unavoidable subtournaments

Abstract:

Let Dk denote the tournament on 3k vertices consisting of three disjoint vertex classes V1, V2 and V3 of size k, each oriented as a transitive subtournament, and with edges directed from V1 to V2, from V2 to V3 and from V3 to V1. Fox and Sudakov proved that given a natural number k and ε > 0, there is n0(k, ε) such that every tournament of order n ⩾ n0(k,ε) which is ε-far from being transitive contains Dk as a subtournament. Their proof showed that and they conjectured that this could be ...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Files:
Publisher copy:
10.1017/S0963548316000213

Authors


More by this author
Department:
Oxford, MPLS, Mathematical Institute
Publisher:
Cambridge University Press Publisher's website
Journal:
Combinatorics, Probability and Computing Journal website
Volume:
26
Issue:
1
Pages:
68-77
Publication date:
2016-06-21
DOI:
EISSN:
1469-2163
ISSN:
0963-5483
Pubs id:
pubs:687040
URN:
uri:cb65e527-6ade-43af-96bb-f65718016801
UUID:
uuid:cb65e527-6ade-43af-96bb-f65718016801
Local pid:
pubs:687040

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP