
Horizons of Combinatorics
Springer (Publisher)
Published on 24. April 2008
Book
Hardback
280 pages
978-3-540-77199-9 (ISBN)
Description
Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structures, combinatorial geometry as well.
The recent volume contains high level surveys on these topics with authors mostly being invited speakers for the conference "Horizons of Combinatorics" held in Balatonalmadi, Hungary in 2006. The collection gives a very good overview of recent trends and results in a large part of combinatorics and related topics, and offers an interesting reading for experienced specialists as well as to young researchers and students.
More details
Series
Edition
2008 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
280 p.
Dimensions
Height: 247 mm
Width: 170 mm
Thickness: 20 mm
Weight
648 gr
ISBN-13
978-3-540-77199-9 (9783540771999)
DOI
10.1007/978-3-540-77200-2
Schweitzer Classification
Other editions
Additional editions

Ervin Gyori | Gyula O.H. Katona | László Lovász
Horizons of Combinatorics
Book
11/2010
Springer
€106.99
Shipment within 7-9 days

Ervin Gyori | Gyula O.H. Katona | László Lovász
Horizons of Combinatorics
E-Book
10/2008
1st Edition
Springer
€96.29
Available for download
Persons
Content
Ballot Theorems, Old and New.- Statistical Inference on Random Structures.- Proof Techniques for Factor Theorems.- Erd?s-Hajnal-type Results on Intersection Patterns of Geometric Objects.- Old and New Problems and Results in Ramsey Theory.- Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method).- Subsums of a Finite Sum and Extremal Sets of Vertices of the Hypercube.- Combinatorial Conditions for the Rigidity of Tensegrity Frameworks.- Polygonal Graphs.- Infinite Combinatorics: From Finite to Infinite.- The Random Walk Method for Intersecting Families.- Problems and Results on Colorings of Mixed Hypergraphs.- Random Discrete Matrices.