More sets, graphs and numbers : a salute to vera Sos and Andras Hajnal / G. O. H. Katona, Ervin Gyori, László Lovasz

Contents: M. Beck [Matthias Beck], X. Wang [Xueqin Wang] and T. Zaslavsky, A unifying generalization of Sperner's theorem (9–24); Y. F. Bilu [Yuri F. Bilu] and D. Masser, A quick proof of Sprindzhuk's decomposition theorem (25–32); B. Bollobás and A. D. Scott [Alexander D. Scott], Discrepancy in graphs and hypergraphs (33–56); É. Czabarka, O. Sýkora, L. A. Székely and I. Vrťo, Biplanar crossing numbers. I. A survey of results and problems (57–77); C. Doche and M. Mendès France, An exercise on the average number of real zeros of random real polynomials (79–92); A. Frank [András Frank], Edge-connection of graphs, digraphs, and hypergraphs (93–141); K. Győry, Perfect powers in products with consecutive terms from arithmetic progressions (143–155); I. Juhász [István Juhász] and A. Szymanski [Andrzej Szymański], The topological version of Fodor's theorem (157–174); A. Kostochka, Color-critical graphs and hypergraphs with few edges: a survey (175–197); M. Krivelevich and B. Sudakov, Pseudo-random graphs (199–262); J. Nešetřil, Bounds and extrema for classes of graphs and finite structures (263–283); J. Pach, R. Radoičić and G. Tóth [Géza Tóth1], Relaxing planarity for topological graphs (285–300); A. Pethő [Attila Pethő], Notes on CNS polynomials and integral interpolation (301–315); A. Recski and D. Szeszlér, The evolution of an idea—Gallai's algorithm (317–328); A. Sárközy, On the number of additive representations of integers (329–339); L. Soukup [Lajos Soukup], A lifting theorem on forcing LCS spaces (341–358); A. Thomason, Extremal functions for graph minors (359–380); R. Tijdeman, Periodicity and almost-periodicity (381–405)