Horizons of Combinatorics (häftad)
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
280
Utgivningsdatum
2010-11-24
Upplaga
Softcover reprint of hardcover 1st ed. 2008
Förlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Medarbetare
Gyori, Ervin (ed.), Lovász, László (ed.), Katona, Gyula O. H. (ed.)
Illustrationer
280 p.
Dimensioner
244 x 170 x 15 mm
Vikt
454 g
Antal komponenter
1
Komponenter
1 Paperback / softback
ISBN
9783642095894
Horizons of Combinatorics (häftad)

Horizons of Combinatorics

Häftad Engelska, 2010-11-24
1389
Skickas inom 10-15 vardagar.
Fri frakt inom Sverige för privatpersoner.
Finns även som
Visa alla 2 format & utgåvor
Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structures, and combinatorial geometry. 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 an overview of recent trends and results in a large part of combinatorics and related topics.
Visa hela texten

Passar bra ihop

  1. Horizons of Combinatorics
  2. +
  3. More Sets, Graphs and Numbers

De som köpt den här boken har ofta också köpt More Sets, Graphs and Numbers av Ervin Gyori, Gyula O H Katona, Laszlo Lovasz (häftad).

Köp båda 2 för 3158 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Bloggat om Horizons of Combinatorics

Innehållsförteckning

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.