论文信息 - On the Chromatic Number, Colorings, and Codes of the Johnson Graph

On the Chromatic Number, Colorings, and Codes of the Johnson Graph

Abstract We consider the Johnson graph J(n, w), 0 ⩽ w ⩽ n. The graph has ( n w ) vertices representing the ( n w ) w-subsets of an n-set. Two vertices are connected by an edge if the intersection between their w-subsets is a (w − 1)-set. Let θ(n, w) be the chromatic number of this graph. It is well known that θ(n, w) ⩽ n. We give some constructions which yield θ(n, w)

Tuvi Etzion | Sara Bitan

[1] Alan Hartman,et al. Towards a Large Set of Steiner Quadruple Systems , 1991, SIAM J. Discret. Math..

[2] M. R. Best. A(11,4,4) = 35 or some new optimal constant weight codes , 1977 .

[3] Tuvi Etzion. Partitions of Triples into Optimal Packings , 1992, J. Comb. Theory, Ser. A.

[4] Tuvi Etzion. Large sets of coverings , 1994 .

[5] Jia-Xi Lu,et al. On Large Sets of Disjoint Steiner Triple Systems III , 1983, J. Comb. Theory, Ser. A.

[6] Tuvi Etzion,et al. New lower bounds for constant weight codes , 1989, IEEE Trans. Inf. Theory.

[7] Tuvi Etzion. Optimal Partitions for Triples , 1992, J. Comb. Theory, Ser. A.

[8] Andries E. Brouwer,et al. On the packing of quadruples without common triples : (preprint) , 1977 .

[9] Jia-Xi Lu,et al. On Large Sets of Disjoint Steiner Triple Systems II , 1983, J. Comb. Theory, Ser. A.

[10] Lu Jia-xi,et al. On Large Sets of Disjoint Steiner Triple Systems, IV , 1983, J. Comb. Theory, Ser. A.

[11] Luc Teirlinck,et al. A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems , 1991, J. Comb. Theory, Ser. A.

[12] Tuvi Etzion,et al. The last packing number of quadruples, and cyclic SQS , 1993, Des. Codes Cryptogr..

[13] N. J. A. Sloane,et al. A new table of constant weight codes , 1990, IEEE Trans. Inf. Theory.

[14] N. J. A. Sloane,et al. Lower bounds for constant weight codes , 1980, IEEE Trans. Inf. Theory.