## Abstract We characterize the family of hamiltonian tournaments with the least number of 3βcycles, studying their structure and their score sequence. Furthermore, we obtain the number of nonisomorphic tournaments of this family.
On complete strongly connected digraphs with the least number of 3-cycles
β Scribed by M. Burzio; J. Pelant
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 186 KB
- Volume
- 155
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
The least number of 3-cycles (cycles of length 3) that a hamiltonian tournament of order n can contain is n -2 (see [3]). Since each complete strongly connected digraph contains a spanning hamiltonian subtournament (see [2]), n-2 is also the least number of 3-cycles for these digraphs.
In this paper we characterize the family of complete strongly connected digraphs with the least number of 3-cycles using the structural characterization of hamiltonian tournaments with the same extremal property (see [1]).
π SIMILAR VOLUMES
Let f (n) be the minimum number of cycles present in a 3-connected cubic graph on n vertices. In 1986, C. A. Barefoot, L. Clark, and R. Entringer (Congr. Numer. 53, 1986) showed that f (n) is subexponential and conjectured that f (n) is superpolynomial. We verify this by showing that, for n sufficie