Near-Universal Cycles for Subsets Exist

DOI10.1137/080735795zbMath1231.05049arXiv0809.3725OpenAlexW1980796546MaRDI QIDQ3583316

Tatiana Moyer, Dawn Curtis, Taylor Hines, Glenn H. Hurlbert

Publication date: 27 August 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0809.3725

zbMATH Keywords

coveringpackinguniversal cycleUcycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics on words (68R15) Other designs, configurations (05B30) Eulerian and Hamiltonian graphs (05C45) Combinatorial aspects of packing and covering (05B40)

Related Items (8)

Packing analogue of \(k\)-radius sequences ⋮ Euler tours in hypergraphs ⋮ Short k‐radius sequences, k‐difference sequences and universal cycles ⋮ Universal and near-universal cycles of set partitions ⋮ The existence of \(k\)-radius sequences ⋮ Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set ⋮ Harmonious and achromatic colorings of fragmentable hypergraphs ⋮ Graph universal cycles of combinatorial objects

This page was built for publication: Near-Universal Cycles for Subsets Exist