An Application of Ramsey's Theorem
Canadian mathematical bulletin, Tome 13 (1970) no. 1, pp. 145-146
Voir la notice de l'article provenant de la source Cambridge University Press
By an r-graph, we mean a finite set V of elements called vertices and a collection of some of the r-subsets of V called edges with the property that each vertex is incident with at least one edge. An A-chromatic r-graph is an r-graph all of whose edges are coloured A. Theorem. Let G1, ..., G t denote r-graphs. There exists a nonempty class of r-graphs such that for each if the edges of G are painted arbitrarily in t colours A1, ..., At, then for at least one i in {1, ..., t}, G has an A i-chromatic r-subgraph which is isomorphic to G i.
Cockayne, E. J. An Application of Ramsey's Theorem. Canadian mathematical bulletin, Tome 13 (1970) no. 1, pp. 145-146. doi: 10.4153/CMB-1970-032-5
@article{10_4153_CMB_1970_032_5,
author = {Cockayne, E. J.},
title = {An {Application} of {Ramsey's} {Theorem}},
journal = {Canadian mathematical bulletin},
pages = {145--146},
year = {1970},
volume = {13},
number = {1},
doi = {10.4153/CMB-1970-032-5},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1970-032-5/}
}
[1] 1. Ryser, H. J., Combinatorial mathematics, Carus Math. Monograph, Math. Assoc. America, 1963. Google Scholar
[2] 2. Ramsey, F. P., On a problem of formal logic, Proc. London Math. Soc. (2nd Series) 30 (1930), 264-286. Google Scholar
Cité par Sources :