Construction of Special Edge-Chromatic Graphs
- 1 October 1965
- journal article
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 8 (5) , 575-584
- https://doi.org/10.4153/cmb-1965-041-7
Abstract
The configuration formed by N points in general position in space, together with thelines 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].Keywords
This publication has 4 references indexed in Scilit:
- A theorem of RamseyPublished by American Mathematical Society (AMS) ,1963
- The Construction of Certain GraphsCanadian Journal of Mathematics, 1962
- Combinatorial Relations and Chromatic GraphsCanadian Journal of Mathematics, 1955
- On a Problem of Formal LogicProceedings of the London Mathematical Society, 1930