𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Hamiltonian cycle Decompositions of Complete 3-Uniform Hypergraphs

✍ Scribed by Baoguang Xu; Jianfang Wang

Book ID
108497966
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
461 KB
Volume
11
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Hamilton decompositions of complete 3-un
Hamilton decompositions of complete 3-uniform hypergraphs
✍ Helen Verrall πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 947 KB

The problem of finding a Hamilton decomposition of the complete 3-uniform hypergraph K,3 has been solved for n = 2 (mod 3) and n = 4(mod 6) . We find here a Hamilton decomposition of Ki, no l(mod 6), and a Hamilton decomposition of the complete 3-uniform hypergraph minus a l-factor, Ki -I, n = 0 (mo

On complete strongly connected digraphs
On complete strongly connected digraphs with the least number of 3-cycles
✍ M. Burzio; J. Pelant πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 186 KB

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 pape