Premium
Hamilton cycles in block‐intersection graphs of triple systems
Author(s) -
Horák Peter,
Pike David A.,
Raines Michael E
Publication year - 1999
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/(sici)1520-6610(1999)7:4<243::aid-jcd2>3.0.co;2-a
Subject(s) - combinatorics , mathematics , graph , intersection (aeronautics) , block (permutation group theory) , hamiltonian path , discrete mathematics , engineering , aerospace engineering
Given a BIBD S = ( V , B ), its 1‐block‐intersection graph G s has as vertices the elements of B ; two vertices B 1 , B 2 ∈ B are adjacent in G s if | B 1 ∩ B 2 | = 1. If S is a triple system of arbitrary index λ, it is shown that G S is hamiltonian. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 243‐246, 1999