Vertex-pancyclicity of hypertournaments

Jed Yang

Research output: Contribution to journalArticlepeer-review

11 Scopus citations


A hypertournament or a k-tournament, on n vertices, 2≤κ≤n, is a pair T=(V,E), where the vertex set V is a set of size n and the edge set E is the collection of all possible subsets of sizeκ of V, called the edges, each taken in one of its k! possible permutations. A k-tournament is pancyclic if there exists (directed) cycles of all possible lengths; it is vertex-pancyclic if moreover the cycles can be found through any vertex. A k-tournament is strong if there is a path from u to v for each pair of distinct vertices u and v. A question posed by Gutin and Yeo about the characterization of pancyclic and vertex-pancyclic hypertournaments is examined in this article.We extend Moon's Theorem for tournaments to hypertournaments. We prove that if κ≥8 and n≥κ+3, then a k-tournament on n vertices is vertex-pancyclic if and only if it is strong. Similar results hold for other values of k. We also show that when n≥7,κ≥4, and n≥κ+2, a strong k-tournament on n vertices is pancyclic if and only if it is strong. The bound n≥κ+2 is tight. We also find bounds for the generalized problem when we extend vertex-pancyclicity to require d edge-disjoint cycles of each possible length and extend strong connectivity to require d edge-disjointpaths between each pair of vertices. Our results include and extend those of Petrovic and Thomassen.

Original languageEnglish (US)
Pages (from-to)338-348
Number of pages11
JournalJournal of Graph Theory
Issue number4
StatePublished - Apr 2010
Externally publishedYes


  • Hamiltonian cycles
  • Hypertournaments


Dive into the research topics of 'Vertex-pancyclicity of hypertournaments'. Together they form a unique fingerprint.

Cite this