The number of edge disjoint transitive triples in a tournament

2003/04/14 by Raphael Yuster, Yuster, Raphael
Mathematics · #05C20 #05C70 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C20 #msc:05C70

paper · pdf · doi:10.48550/arxiv.math/0304180

7 pages

arxiv created 2003/04/14 · arxiv updated 2009/11/30

Abstract

We prove that a tournament with n vertices has more than 0.13n²(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.

Related

• Tiling transitive tournaments and their blow-ups
• On the number of 4-cycles in a tournament
• Cycles of length three and four in tournaments
• Quasi-Carousel Tournaments
• On the Density of Transitive Tournaments