Horizons of combinatorics / Ervin Győri, Gyula O.H. Katona, László Lovász

Contents: L. Addario-Berry and B. A. Reed, Ballot theorems, old and new (9–35); Villő Csiszár, Lídia Rejtő and Gábor Tusnády, Statistical inference on random structures (37–66); Yoshimi Egawa, Proof techniques for factor theorems (67–78); Jacob Fox and János Pach, Erdős–Hajnal-type results on intersection patterns of geometric objects (79–103); Ron Graham, Old and new problems and results in Ramsey theory (105–118); Gyula O. H. Katona, Forbidden intersection patterns in the families of subsets (introducing a method) (119–140); Dezső Miklós, Subsums of a finite sum and extremal sets of vertices of the hypercube (141–161); András Recski, Combinatorial conditions for the rigidity of tensegrity frameworks (163–177); Ákos Seress, Polygonal graphs (179–188); Lajos Soukup, Infinite combinatorics: from finite to infinite (189–213); Norihide Tokushige, The random walk method for intersecting families (215–234); Zsolt Tuza and Vitaly Voloshin [V. I. Voloshin], Problems and results on colorings of mixed hypergraphs (235–255); Van Vu, Random discrete matrices (257–280)