Construction of Special Edge-Chromatic Graphs
Canadian mathematical bulletin, Tome 8 (1965) no. 5, pp. 575-584
Voir la notice de l'article provenant de la source Cambridge
The configuration formed by N points in general position in space, together with the lines joining them in pairs will be called an N-clique. The N-clique is coloured by assigning to each edge exactly one colour from a set of t possible colours. A theorem due to Ramsey [4] ensures the existence of a least integer M(q1, q2, ..., qt) such that if N ≥ M, any such colouring of the N-clique must contain either a q1-clique entirely of colour 1, or a q2-clique of colour 2, ..., or a qt-clique of colour t. Another proof of Ramsey's theorem is given by Ryser [5].
Kalbfleisch, J. G. Construction of Special Edge-Chromatic Graphs. Canadian mathematical bulletin, Tome 8 (1965) no. 5, pp. 575-584. doi: 10.4153/CMB-1965-041-7
@article{10_4153_CMB_1965_041_7,
author = {Kalbfleisch, J. G.},
title = {Construction of {Special} {Edge-Chromatic} {Graphs}},
journal = {Canadian mathematical bulletin},
pages = {575--584},
year = {1965},
volume = {8},
number = {5},
doi = {10.4153/CMB-1965-041-7},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-041-7/}
}
Cité par Sources :