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

algorithm Anyuka applications B₁ bipartite graph blocking set Bollobás Budapest cardinality chromatic number circuit Combinatorics complete graph Computing conjecture connected contains Corollary define denote dense graphs density digraph Discrete Math Discrete Mathematics disjoint distribution divisors duality edge-disjoint eigenvalues Erdős's exists extremal graph extremal graph theory Faudree finite function graph G graph theory Hajnal Hence homomorphic Hungarian Hungary hypergraphs implies inequality integers J-good cuts KöMaL Let G Lovász lower bound Łuczak mathematicians matroid maximum minimum multigraph n-connected n-minimal graph node number of edges number theory obtained pairs partition identities path Paul Erdős Paul Turán planar plane points polynomial prime probability Proc proof of Theorem proved Rado Ramsey theory random graph random graph process random hypergraphs random walk Regularity Lemma Rényi Rödl Sárközy sequence Simonovits subgraphs subset Szemerédi T-cuts T-join trees Turán undirected upper bound V₁ Vera Sós