More Sets, Graphs and Numbers

Ervin Gyori

ISBN 10: 3540323775 / ISBN 13: 9783540323778

Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Mär 2006, 2006

Riguardo questo articolo

Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 412 pp. Englisch.

Codice articolo 9783540323778

Dati bibliografici

• Titolo: More Sets, Graphs and Numbers
• Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Mär 2006
• Data di pubblicazione: 2006
• Lingua: Inglese
• ISBN 10: 3540323775
• ISBN 13: 9783540323778
• Rilegatura: Buch
• Condizione: Neu
• Dimensioni: 241 L x 160 A x 27 P (millimetri) 241 millimetri di larghezza per 160 millimetri di altezza per 27 millimetri di profondità
• Peso: 781 grammi

Descrizione articolo

Riassunto

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.

Contenuti

Contents.- Preface.- M. Beck, X. Wang, T. Zaslavsky: A Unifying Generalization of Sperner’s Theorem.- Y.F. Bilu, D. Masser: A Quick Proof of Sprindzhuk’s Decomposition Theorem.- B. Bollobas, A.D. Scott: Discrepancy in Graphs and Hypergraphs.- E. Czabarka, O. Sykora, L.A. Szekely, I. Vrt’o: 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 Fodor’s Theorem.- A. Kostochka: Color-Critical Graphs and Hypergraphs with Few Edges: A Survey.- M. Krivelevich, B. Sudakov: Pseudo-random Graphs.- J. Nesetril: Bounds and Extrema for Classes of Graphs and Finite Structures.- J. Pach, R. Radoicic, G. Toth: Relaxing Planarity for Topological Graphs.- A. Pethö: Notes on CNS Polynominals and Integral Interpolation.- A. Recski, D. Szeszler: The Evolution of an Idea – Gallai’s Algorithm.- A. Sarközy: On the Number of Additive Representations of Integers.- L. Soukup: A Lifting Theorem on Forcing LCS Spaces.- A. Thomason: Extremal Functions for Graph Minors.- A Tijdeman: Periodicity and Almost-Periodicity.