Premium
On list coloring Steiner triple systems
Author(s) -
Haxell P. E.,
Pei M.
Publication year - 2009
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/jcd.20215
Subject(s) - combinatorics , mathematics , chromatic scale , steiner system , integer (computer science) , discrete mathematics , computer science , programming language
We study the list chromatic number of Steiner triple systems. We show that for every integer s there exists n 0 = n 0 ( s ) such that every Steiner triple system on n points STS( n ) with n ≥ n 0 has list chromatic number greater than s . We also show that the list chromatic number of a STS( n ) is always within a log n factor of its chromatic number. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 314–322, 2009