论文信息 - Unbalanced Steiner Triple Systems

Unbalanced Steiner Triple Systems

Abstract We study the coloring properties of STSs and derive several inequalities for the sizes of their color classes. Answering a question of A. Rosa, we also construct for any l ⩾6 a family of l -chromatic STSs such that no matter how they are l -colored, almost all vertices belong to the largest three color classes.

Vojtech Rödl | Lucien Haddad | V. Rödl | L. Haddad

[1] J. Spencer. Ramsey Theory , 1990 .

[2] P. Erdös,et al. Graph Theory and Probability , 1959 .

[3] David J. Goodman,et al. Personal Communications , 1994, Mobile Communications.

[4] J. Dénes,et al. Latin squares and their applications , 1974 .

[5] N. Sauer,et al. Maximal Subsets of a given Set having No Triple in Common with a Steiner Triple System on the set , 1969, Canadian Mathematical Bulletin.

[6] C. Colbourn,et al. Greedy Colourings of Steiner Triple Systems , 1983 .

[7] R. C. Bose. ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS , 1939 .

[8] Vojtech Rödl,et al. Coloring Steiner Triple Systems , 1982 .

[9] Paul Erdös,et al. On the combinatorial problems which I would most like to see solved , 1981, Comb..