TS(v, ) with cyclic 2-intersecting Gray codes: v 0 or 412
From MaRDI portal
Publication:2175776
Abstract: A is a pair where contains points and contains -element subsets of so that each pair in appears in exactly blocks. A -block intersection graph (-BIG) of a is a graph where each vertex is represented by a block from the and each pair of blocks are joined by an edge if . Using constructions for given by Schreiber, we show that there exists a for or whose -BIG is Hamiltonian.
Recommendations
- Twofold triple systems with cyclic 2‐intersecting Gray codes
- Twofold triple systems without 2-intersecting Gray codes
- Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs
- scientific article; zbMATH DE number 3882437
- Hamilton cycles in block-intersection graphs of triple systems
Cites work
- scientific article; zbMATH DE number 431053 (Why is no real title available?)
- scientific article; zbMATH DE number 3882437 (Why is no real title available?)
- scientific article; zbMATH DE number 4160773 (Why is no real title available?)
- A Survey of Combinatorial Gray Codes
- Hamilton cycles in block-intersection graphs of triple systems
- Hamiltonian cycles in the cartesian product of a tree and a cycle
- On the existence of 2-designs Slambda(2,3,v) without repeated blocks
- Ordering block designs. Gray codes, universal cycles and configuration orderings
- Some balanced complete block designs
- Twofold triple systems with cyclic 2‐intersecting Gray codes
- Twofold triple systems without 2-intersecting Gray codes
Cited in
(2)
This page was built for publication: \(\mathrm{TS}(v, \lambda)\) with cyclic 2-intersecting Gray codes: \(v\equiv 0\) or \(4\pmod{12}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175776)