Premium
Coloring BIBDs with block size 4
Author(s) -
Linek Václav,
Wantland Evan B.
Publication year - 1998
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(1998)6:6<403::aid-jcd2>3.0.co;2-j
Subject(s) - mathematics , combinatorics , chromatic scale , block size , block (permutation group theory) , integer (computer science) , property (philosophy) , discrete mathematics , computer science , philosophy , computer security , epistemology , key (lock) , programming language
It is shown that for each integer m ≥ 1 there exists a lower bound, v m , with the property that for all v ≥ v m with v ≡ 1, 4 (mod 12) there exists an m ‐chromatic S (2, 4, v ) design. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 403–409, 1998