On c -Bhaskar Rao Designs and tight embeddings for path designs

Under the right conditions it is possible for the ordered blocks of a path design PATH ( v , k , μ ) to be considered as unordered blocks and thereby create a BIBD ( v , k , λ ) . We call this a tight embedding. We show here that, for any triple system TS ( v , 3 ) , there is always such an embeddin...

Full description

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 308; no. 13; pp. 2659 - 2662
Main Authors Hurd, Spencer P., Sarvate, Dinesh G.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 06.07.2008
Subjects
Online AccessGet full text

Cover

Loading…