Twofold triple systems with cyclic 2‐intersecting Gray codes.

Abstract: Given a combinatorial design D with block set B, the <italic>block‐intersection graph</italic> (BIG) of D is the graph that has B as its vertex set, where two vertices B 1 ∈ B and B 2 ∈ B are adjacent if and only if | B 1 ∩ B 2 | > 0. The <italic>i</italic><italic>‐block‐intersection graph</italic> (<italic>i</italic>‐BIG) of D is the graph that has B as its vertex set, where two vertices B 1 ∈ B and B 2 ∈ B are adjacent if and only if | B 1 ∩ B 2 | = i. In this paper, several constructions are obtained that start with twofold triple systems (TTSs) with Hamiltonian 2‐BIGs and result in larger TTSs that also have Hamiltonian 2‐BIGs. These constructions collectively enable us to determine the complete spectrum of TTSs with Hamiltonian 2‐BIGs (equivalently TTSs with cyclic 2‐intersecting Gray codes) as well as the complete spectrum for TTSs with 2‐BIGs that have Hamilton paths (i.e. for TTSs with 2‐intersecting Gray codes). In order to prove these spectrum results, we sometimes require ingredient TTSs that have large partial parallel classes; we prove lower bounds on the sizes of partial parallel classes in arbitrary TTSs, and then construct larger TTSs with both cyclic 2‐intersecting Gray codes and parallel classes. [ABSTRACT FROM AUTHOR]