The number of edge-disjoint transitive triples in a tournament

Research output: Contribution to journalArticlepeer-review


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

Original languageEnglish
Pages (from-to)187-191
Number of pages5
JournalDiscrete Mathematics
Issue number1-3
StatePublished - 28 Oct 2004


  • Tournament
  • Transitive
  • Triple

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'The number of edge-disjoint transitive triples in a tournament'. Together they form a unique fingerprint.

Cite this