An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\)
The electronic journal of combinatorics, Tome 20 (2013) no. 2
In this paper, we introduce a method of constructing Universal Cycles on sets by taking "sums" and "products" of smaller cycles. We demonstrate this new approach by proving that if there exist Universal Cycles on the 4-subsets of [18] and the 4-subsets of [26], then for any integer $n\ge18$ equivalent to $2 \pmod{8}$, there exists a Universal Cycle on the 4-subsets of [n].
DOI :
10.37236/2852
Classification :
05A05, 05A17
Mots-clés : universal cycles, ucycles, sums of cycles, products of cycles
Mots-clés : universal cycles, ucycles, sums of cycles, products of cycles
Affiliations des auteurs :
Yevgeniy Rudoy 1
@article{10_37236_2852,
author = {Yevgeniy Rudoy},
title = {An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\)},
journal = {The electronic journal of combinatorics},
year = {2013},
volume = {20},
number = {2},
doi = {10.37236/2852},
zbl = {1267.05014},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2852/}
}
Yevgeniy Rudoy. An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\). The electronic journal of combinatorics, Tome 20 (2013) no. 2. doi: 10.37236/2852
Cité par Sources :