TS(v,λ) with Cyclic 2-Intersecting Gray Codes: v≡0 or 4(mod12)
Department of Mathematical Sciences
A TS(v,λ) is a pair (V,B) where V contains v points and B contains 3-element subsets of V so that each pair in V appears in exactly λ blocks. A 2-block intersection graph (2-BIG) of a TS(v,λ) is a graph where each vertex is represented by a block from the TS(v,λ) and each pair of blocks Bi,Bj∈B are joined by an edge if |Bi∩Bj|=2. We show that there exists a TS(v,λ) for v≡0 or 4(mod12) whose 2-BIG is Hamiltonian for all admissible (v,λ). This is equivalent to the existence of a TS(v,λ) with a cyclic 2-intersecting Gray code.
Graphs and Combinatorics
Keranen, M. S.
TS(v,λ) with Cyclic 2-Intersecting Gray Codes: v≡0 or 4(mod12).
Graphs and Combinatorics.
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/1606