buchspektrum Internet-Buchhandlung

Neuerscheinungen 2014

Stand: 2020-02-01
Schnellsuche
ISBN/Stichwort/Autor
Herderstraße 10
10625 Berlin
Tel.: 030 315 714 16
Fax 030 315 714 14
info@buchspektrum.de

Ervin Gyori, Gyula O.H. Katona, László Lovász (Beteiligte)

More Sets, Graphs and Numbers


A Salute to Vera Sňs and András Hajnal
Herausgegeben von Gyori, Ervin; Katona, Gyula O.H.; Lovász, László
2006. 2014. viii, 399 S. 235 mm
Verlag/Jahr: SPRINGER, BERLIN; SPRINGER BERLIN HEIDELBERG 2014
ISBN: 3-642-42163-6 (3642421636)
Neue ISBN: 978-3-642-42163-1 (9783642421631)

Preis und Lieferzeit: Bitte klicken


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.
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.
László Lovász ist einer der Leiter der theoretischen Forschungsabteilung der Microsoft Corporation. Er hat 1999 den Wolf-Preis sowie den Gödel-Preis für die beste wissenschaftliche Veröffentlichung in der Informatik erhalten.