More Sets, Graphs and Numbers A Salute to Vera Sòs and András Hajnal

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 rese...

Full description

Bibliographic Details
Other Authors: Gyori, Ervin (Editor), Katona, Gyula O.H. (Editor), Lovász, László (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2006, 2006
Edition:1st ed. 2006
Series:Bolyai Society Mathematical Studies
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 02823nmm a2200349 u 4500
001 EB000375511
003 EBX01000000000000000228563
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9783540324393 
100 1 |a Gyori, Ervin  |e [editor] 
245 0 0 |a More Sets, Graphs and Numbers  |h Elektronische Ressource  |b A Salute to Vera Sòs and András Hajnal  |c edited by Ervin Gyori, Gyula O.H. Katona, László Lovász 
250 |a 1st ed. 2006 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2006, 2006 
300 |a VIII, 399 p  |b online resource 
505 0 |a A Unifying Generalization of Sperner’s Theorem -- A Quick Proof of Sprindzhuk’s Decomposition Theorem -- Discrepancy in Graphs and Hypergraphs -- Biplanar Crossing Numbers I: A Survey of Results and Problems -- An Exercise on the Average Number of Real Zeros of Random Real Polynomials -- Edge-Connection of Graphs, Digraphs, and Hypergraphs -- Perfect Powers in Products with Consecutive Terms from Arithmetic Progressions -- The Topological Version of Fodor’s Theorem -- Color-Critical Graphs and Hypergraphs with Few Edges: A Survey -- Pseudo-random Graphs -- Bounds and Extrema for Classes of Graphs and Finite Structures -- Relaxing Planarity for Topological Graphs -- Notes on CNS Polynomials and Integral Interpolation -- The Evolution of an Idea — Gallai’s Algorithm -- On the Number of Additive Representations of Integers -- A Lifting Theorem on Forcing LCS Spaces -- Extremal Functions for Graph Minors -- Periodicity and Almost-Periodicity 
653 |a Number theory 
653 |a Mathematical logic 
653 |a Number Theory 
653 |a Discrete Mathematics 
653 |a Discrete mathematics 
653 |a Mathematical Logic and Foundations 
700 1 |a Katona, Gyula O.H.  |e [editor] 
700 1 |a Lovász, László  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Bolyai Society Mathematical Studies 
028 5 0 |a 10.1007/978-3-540-32439-3 
856 4 0 |u https://doi.org/10.1007/978-3-540-32439-3?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 511.1 
520 |a 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