Hamilton cycles in block-intersection graphs of triple systems

Abstract

Given a BIBD S = (V, B), its 1-block-intersection graph Gs has as vertices the elements of B; two vertices B1, B2 ∈ B are adjacent in Gs if |B1 ∩ B2| = 1. If S is a triple system of arbitrary index λ, it is shown that GS is hamiltonian. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 243-246, 1999