Let {Hi}i,2 ..... k be an isomorphic factorization of K. where k >/2 and k divides Β½n(n -1). If there is a permutation fl on V(K.) such that fl: V(Ht)---~ V(Ht,.,) is an isomorphism for i = 1, 2 ..... k -1 where {Ht,}i = 1,2 ..... k is a rearrangement of {H~}i = 1,2 ..... k then a graph G of order n
Universal cycles of k-subsets and k-permutations
β Scribed by B.W. Jackson
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 701 KB
- Volume
- 117
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper the author constructs universal cycles of 3-subsets of an n-set for n 28 and (n, 3)= 1, verifying a conjecture of Chung et al. ( ) for 3-subsets. Universal cycles of 4-subsets of an n-set for n > 8 and (n, 4) = 1 are also constructed, partially solving the same conjecture for 4-subsets. Universal cycles of k-permutations are constructed for any k > 3 and n > k + 1.
π SIMILAR VOLUMES
## Abstract Let Ξ± denote a permutation of the __n__ vertices of a connected graph __G__. Define Ξ΄~Ξ±~(__G__) to be the number $\sum |d(x,y)-d(\alpha (x),\alpha(y))|$, where the sum is over all the $\left({n \atop 2} \right)$ unordered pairs of distinct vertices of __G__. The number Ξ΄~Ξ±~(__G__) is ca
## Abstract Thomassen [J Graph Theory 7 (1983), 261β271] conjectured that for all positive integers __k__ and __m__, every graph of minimum degree at least __k__+1 contains a cycle of length congruent to 2__m__ modulo __k__. We prove that this is true for __k__β©Ύ2 if the minimum degree is at least 2
Let u be a positive integer and Z, the residue class ring modulo U. Two subsets D1 and D, of Z, are said to be equivalent if there exist t,seZ, with gcd(t, v)= 1 such that D, = tD, +s. We are interested in the number of equivalence classes of k-subsets of 2, and the number of equivalence classes of