## Abstract A set __S__ of edgeβdisjoint hamilton cycles in a graph __G__ is said to be __maximal__ if the edges in the hamilton cycles in __S__ induce a subgraph __H__ of __G__ such that __G__βββ__E__(__H__) contains no hamilton cycles. In this context, the spectrum __S__(__G__) of a graph __G__ i
Maximal sets of Hamilton cycles inKn,n
β Scribed by Bryant, Darryn E.; El-Zanati, S.; Rodger, C. A.
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 271 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
In this article, we prove that there exists a maximal set of m Hamilton cycles in K n,n if and only if n/4 < m β€ n/2.
π SIMILAR VOLUMES
## Abstract A large set of __CS__(__v__, __k__, Ξ»), __k__βcycle system of order __v__ with index Ξ», is a partition of all __k__βcycles of __K__~__v__~ into __CS__(__v__, __k__, Ξ»)s, denoted by __LCS__(__v__, __k__, Ξ»). A (__v__βββ1)βcycle is called almost Hamilton. The completion of the existence s
In this paper it is shown that given a non-degenerate elliptic quadric in the projective space PG(2n -1, q), q odd, then there does not exist a spread of PG(2n -1, q) such that each element of the spread meets the quadric in a maximal totally singular subspace. An immediate consequence is that the c