Combinatorics, Paul Erdős is Eighty, כרך 2

A₁ Acta Math additive number theory algebra algorithm Amer Amsterdam association scheme assume b₁ Bolyai Bull C₁ cardinal chromatic number circuit closure cofinal Colloq colour Combinatorial Theory complete graph computing Conf conjecture contains Corollary cycle defined denote direct decomposition directed graph Discrete Math disjoint paths edge-colouring edges elements embedded exists extremal problems finite set Forb(F function graph G graph theory Hajnal hence Hungar hypergraph implies inequality infinite integers intersection isomorphic János Bolyai Keszthely Lapok Lemma linear London Math lower bound Mathematics matrix n₁ North-Holland number theory pairs pairwise partition property Paul Erdős permutations player polynomial poset prime Problems and results Proc proof proved Ramsey Ramsey theory random graphs Sárközy sequence Sperner families strategy subgraph subgroup subset Suppose Theorem threshold gates Turán Univ upper bound vector vertex vertices zero sum sets