More Sets, Graphs and Numbers
A Salute to Vera Sòs and András Hajnal
Published on 21. November 2014
Book
Paperback/Softback
VIII, 399 pages
978-3-642-42163-1 (ISBN)
Description
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.
More details
Series
Edition
2006 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
VIII, 399 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 21 mm
Weight
690 gr
ISBN-13
978-3-642-42163-1 (9783642421631)
DOI
10.1007/978-3-540-32439-3
Schweitzer Classification
Other editions
Additional editions
Ervin Gyori | Gyula O.H. Katona | László Lovász
More Sets, Graphs and Numbers
A Salute to Vera Sòs and András Hajnal
E-Book
10/2010
1st Edition
Springer
€96.29
Available for download
Ervin Gyori | Gyula O.H. Katona | László Lovász
More Sets, Graphs and Numbers
A Salute to Vera Sòs and András Hajnal
Book
03/2006
Springer
€106.99
Shipment within 10-15 days
Persons
Content
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.