Surveys in Combinatorics 1987: Invited Papers for the Eleventh British Combinatorial Conference

apply assume bound called canonical cardinal Clearly color Combinatorial complete computation conjecture connected consequence consider consists constant construction contains Corollary defined definition denote density designs disjoint edges elements Erdös example exists extremal fact factors finite fixed function geometry give given graph graph G Hajnal holds hypothesis implies improved incident independent induced infinite input integer interesting intersecting known later least Lemma lower bound Math Mathematical measure methods metric monochromatic Note obtain pair partition path perfect periodic planes points positive possible probability problem progression proof properties Proposition proved question Ramsey numbers random graph regular relation representation result satisfies sequence space structure subgraph subsets sum-free Suppose term Theorem theory tree true University upper bound vertex vertices