Geodesic
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 University Press

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/}
}
TY  - JOUR
AU  - Kalbfleisch, J. G.
TI  - Construction of Special Edge-Chromatic Graphs
JO  - Canadian mathematical bulletin
PY  - 1965
SP  - 575
EP  - 584
VL  - 8
IS  - 5
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-041-7/
DO  - 10.4153/CMB-1965-041-7
ID  - 10_4153_CMB_1965_041_7
ER  - 
%0 Journal Article
%A Kalbfleisch, J. G.
%T Construction of Special Edge-Chromatic Graphs
%J Canadian mathematical bulletin
%D 1965
%P 575-584
%V 8
%N 5
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-041-7/
%R 10.4153/CMB-1965-041-7
%F 10_4153_CMB_1965_041_7

[1] 1. Erdȍs, P. and Rogers, C. A., The Construction of Certain Graphs. Can. J. Math., 14 (1962), 702-707. Google Scholar

[2] 2. Erdȍs, P. and Szekeres, G., A Combinatorial Problem in Geometry. Compositio Math. 2 (1935), 463-470. Google Scholar

[3] 3. Greenwood, R.E. and Gleason, A.M., Combinatorial Relations and Chromatic Graphs. Can. J. Math. 7 (1955), 1-7. Google Scholar

[4] 4. Ramsey, F.P., On a Problem of Formal Logic. Proc. London Math. Soc., 2nd series,30 (1930), 264-286. Google Scholar

[5] 5. Ryser, H.J., Combinatorial Mathematics. Carus Math. Monograph 14 (1963), Ch. IV, 38-43. Google Scholar

Cité par Sources :