Ebook: Horizons of Combinatorics
Author: L. Addario-Berry B. A. Reed (auth.) Ervin Győri Gyula O. H. Katona László Lovász Gábor Sági (eds.)
- Tags: Combinatorics, Algorithms, Probability and Statistics in Computer Science, Statistical Theory and Methods
- Series: Bolyai Society Mathematical Studies 17
- Year: 2008
- Publisher: Springer-Verlag Berlin Heidelberg
- Edition: 1
- Language: English
- pdf
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.
Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structures, and 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.
Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structures, and 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.
Content:
Front Matter....Pages 1-8
Ballot Theorems, Old and New....Pages 9-35
Statistical Inference on Random Structures....Pages 37-66
Proof Techniques for Factor Theorems....Pages 67-78
Erd?s-Hajnal-type Results on Intersection Patterns of Geometric Objects....Pages 79-103
Old and New Problems and Results in Ramsey Theory....Pages 105-118
Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)....Pages 119-140
Subsums of a Finite Sum and Extremal Sets of Vertices of the Hypercube....Pages 141-161
Combinatorial Conditions for the Rigidity of Tensegrity Frameworks....Pages 163-177
Polygonal Graphs....Pages 179-188
Infinite Combinatorics: From Finite to Infinite....Pages 189-213
The Random Walk Method for Intersecting Families....Pages 215-234
Problems and Results on Colorings of Mixed Hypergraphs....Pages 235-255
Random Discrete Matrices....Pages 257-280
Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structures, and 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.
Content:
Front Matter....Pages 1-8
Ballot Theorems, Old and New....Pages 9-35
Statistical Inference on Random Structures....Pages 37-66
Proof Techniques for Factor Theorems....Pages 67-78
Erd?s-Hajnal-type Results on Intersection Patterns of Geometric Objects....Pages 79-103
Old and New Problems and Results in Ramsey Theory....Pages 105-118
Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)....Pages 119-140
Subsums of a Finite Sum and Extremal Sets of Vertices of the Hypercube....Pages 141-161
Combinatorial Conditions for the Rigidity of Tensegrity Frameworks....Pages 163-177
Polygonal Graphs....Pages 179-188
Infinite Combinatorics: From Finite to Infinite....Pages 189-213
The Random Walk Method for Intersecting Families....Pages 215-234
Problems and Results on Colorings of Mixed Hypergraphs....Pages 235-255
Random Discrete Matrices....Pages 257-280
....