Gyori, Ervin, Katona, Gyula O.H., Lovász, László (Eds.)
Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
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 Level »Research
Keywords »Algorithms - Discrete Mathematics - Hypergraph - Hypergraphs - Infinite Combinatorics - Ramsey theory - Random Structures - Set Theory - combinatorial geometry - combinatorics - geometry - graphs - number theory - sets - vertices
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.