An application of Ramsey's theorem

E. J. Cockayne
1970 Canadian mathematical bulletin  
By an r-graph, we mean a finite set F 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 ^-chromatic r-graph is an r-graph all of whose edges are coloured A. ., A t9 then for at least one i in {1,..., t} 9 G has an Achromatic r-subgraph which is isomorphic to G { .
doi:10.4153/cmb-1970-032-5 fatcat:lofi3mpx65cu5m2mbpjp7zazby