Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T01:21:20.748Z Has data issue: false hasContentIssue false

An Application of Ramsey's Theorem

Published online by Cambridge University Press:  20 November 2018

E. J. Cockayne*
Affiliation:
University of Victoria, Victoria, British Columbia
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1970