Edge-disjoint Hamiltonian cycles in hypertournaments

A hypertournament or a k-tournament, on n vertices, 2≤k≤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 k of V, called the edges, each taken in one of its k! possible ...

Nash-Williams [1] proved that every graph with n vertices and minimum degree n/2 has at least @?5n/224@? edge-disjoint Hamiltonian cycles. In [2], he raised the question of determining the maximum number of edge-disjoint Hamiltonian cycles, showing an ...

In 2004, Bang-Jensen introduced H"i-free digraphs, for i in {1,2,3,4}, as a generalization of semicomplete and semicomplete bipartite digraphs. Bang-Jensen conjectured that an H"i-free digraph D, for i in {1,2,3,4}, is Hamiltonian if and only if D is ...