Universal and near-universal cycles of set partitions

zbMath1329.05160arXiv1502.04076MaRDI QIDQ907241

Zach Higgins, Bertilla Sieben, Anant P. Godbole, Elizabeth Kelley

Publication date: 25 January 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

universal cyclesucycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Graph universal cycles of combinatorial objects

Cites Work

• Unnamed Item
• Unnamed Item
• Ordering block designs. Gray codes, universal cycles and configuration orderings
• Universal cycles of \((n - 1)\)-partitions of an \(n\)-set
• Universal cycles for combinatorial structures
• Near-Universal Cycles for Subsets Exist
• Universal Cycles of Discrete Functions
• Number of Odd Binomial Coefficients
• On Universal Cycles for k-Subsets of an n-Set
• Threshold Functions for Distinct Parts: Revisiting Erdős–Lehner

This page was built for publication: Universal and near-universal cycles of set partitions