More Sets, Graphs and Numbers A Salute to Vera Ss and Andrs Hajnal [Hardcover]

This volume honours the eminent mathematicians Vera Sos and Andras Hajnal. The book includes survey articles reviewing classical theorems, as well as new, state-of-the-art results. Also presented are cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers are sure to inspire further research.

Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and state-of-the-art results) and cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers inspire further research.

The volume is recommended to experienced specialists as well as to young researchers and students.

Contents.- Preface.- M. Beck, X. Wang, T. Zaslavsky: A Unifying Generalization of Sperners Theorem.- Y.F. Bilu, D. Masser: A Quick Proof of Sprindzhuks Decomposition Theorem.- B. Bollobas, A.D. Scott: Discrepancy in Graphs and Hypergraphs.- E. Czabarka, O. Sykora, L.A. Szekely, I. Vrto: Biplanar Crossing Numbers I: A Survey of Results and Problems.- C. Doche, M. Mendes France: An Exercise on the Average Number of Real Zeros of Random Real Polynomials.- A. Frank: Edge-Connection of Graphs, Digraphs, and Hypergraphs.- K. Gy?ry: Perfect Powers in Products with Consecutive Terms from Arithmetic Progressions.- I. Juhasz, A. Szymanski: The Topological Version of Fodors Theorem.- A. Kostochka: Color-Critical Graphs and Hypergraphs with Few Edges: A Survey.- M. Krivelevich, B. Sudakov: PselC™