Universal cycles of (n - 1)-partitions of an n-set

DOI10.1016/J.DISC.2009.03.002zbMATH Open1207.05004OpenAlexW2094047170MaRDI QIDQ1044896FDOQ1044896

Authors: Karel Casteels, Brett Stevens 

Publication date: 15 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.002

Recommendations

• Universal and near-universal cycles of set partitions
• Universal cycles for combinatorial structures
• Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\)
• On Universal Cycles for k-Subsets of an n-Set
• On universal cycles for new classes of combinatorial structures

zbMATH Keywords

permutationsuniversal cyclesset partitionscombinatorial orderings

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Partitions of sets (05A18)

Cites Work

• Title not available (Why is that?)
• A problem in arrangements
• Title not available (Why is that?)
• Title not available (Why is that?)
• Normal Recurring Decimals
• Universal cycles for combinatorial structures
• Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\)
• Universal cycles of \(k\)-subsets and \(k\)-permutations
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Multicover Ucycles

Cited In (7)

• On Universal Cycles for k-Subsets of an n-Set
• Universal cycles for combinatorial structures
• Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\)
• An explicit universal cycle for the ( n -1)-permutations of an n -set
• Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set
• Universal and near-universal cycles of set partitions
• On universal cycles for multisets

This page was built for publication: Universal cycles of \((n - 1)\)-partitions of an \(n\)-set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044896)