Packing triangles in regular tournaments

Research output: Contribution to journalArticlepeer-review


We prove that a regular tournament with n vertices has more than n 2/11.5(1-o(1)) pairwise arc-disjoint directed triangles. On the other hand, we construct regular tournaments with a feedback arc set of size less than n2/8, so these tournaments do not have n2/8 pairwise arc-disjoint triangles.

Original languageEnglish
Pages (from-to)58-66
Number of pages9
JournalJournal of Graph Theory
Issue number1
StatePublished - Sep 2013


  • fractional
  • packing
  • tournament

ASJC Scopus subject areas

  • Geometry and Topology


Dive into the research topics of 'Packing triangles in regular tournaments'. Together they form a unique fingerprint.

Cite this