The number of edge-disjoint transitive triples in a tournament

We prove that a tournament with n vertices has more than 0.13 n 2 ( 1 + o ( 1 ) ) edge-disjoint transitive triples. We also prove some results on the existence of large packings of k-vertex transitive tournaments in an n-vertex tournament. Our proofs combine probabilistic arguments and some powerful...

Full description

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 287; no. 1; pp. 187 - 191
Main Author Yuster, Raphael
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 28.10.2004
Elsevier
Subjects
Combinatorics
Combinatorics. Ordered structures
Designs and configurations
Exact sciences and technology
Graph theory
Mathematics
Sciences and techniques of general use
Tournament
Transitive
Triple
Triple
Transitive
Tournament
Discrete mathematics
Packing
Combinatorics
Transitive triple
Online AccessGet full text

Cover

More Information
Summary:We prove that a tournament with n vertices has more than 0.13 n 2 ( 1 + o ( 1 ) ) edge-disjoint transitive triples. We also prove some results on the existence of large packings of k-vertex transitive tournaments in an n-vertex tournament. Our proofs combine probabilistic arguments and some powerful packing results due to Wilson and to Frankl and Rödl.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2004.07.005