Combinatorics and Probability
Published on 8. March 2007
Book
Hardback
660 pages
978-0-521-87207-2 (ISBN)
Description
Combinatorics is an area of mathematics involving an impressive breadth of ideas, and it encompasses topics ranging from codes and circuit design to algorithmic complexity and algebraic graph theory. In a highly distinguished career Bela Bollobas has made, and continues to make, many significant contributions to combinatorics, and this volume reflects the wide range of topics on which his work has had a major influence. It arises from a conference organized to mark his 60th birthday and the thirty-one articles contained here are of the highest calibre. That so many excellent mathematicians have contributed is testament to the very high regard in which Bela Bollobas is held. Students and researchers across combinatorics and related fields will find that this volume provides a wealth of insight to the state of the art.
Reviews / Votes
'On top of the quality of the papers, the book is worth reading for its long foreword.' Acta Scientiarum Mathematicarum '... this reviewer was very impressed, and even surprised, by the breadth of the articles of the collection. (Of course, the depth is impressive, too, but that is not surprising, given the pedigree of the contributors.)' MAA ReviewsMore details
Language
English
Place of publication
Cambridge
United Kingdom
Target group
Professional and scholarly
Illustrations
Worked examples or Exercises; 4 Tables, unspecified; 31 Line drawings, unspecified
Dimensions
Height: 250 mm
Width: 175 mm
Thickness: 40 mm
Weight
1300 gr
ISBN-13
978-0-521-87207-2 (9780521872072)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Previous edition
Graham Brightwell | Imre Leader | Alex Scott
Combinatorics and Probability
Book
Cambridge University Press
Unfortunately, price unknown
The article will not be published
Persons
Content
1. Measures of pseudorandomness for finite sequences: minimal values N. Alon, Y. Kohayakawa, C. Mauduit and V. R. Roedl; 2. MaxCut in H-Free graphs Noga Alon, Michael Krivelevich and Benny Sudakov; 3. A tale of three couplings: Poisson-Dirichlet and GEM approximations for random permutations Richard Arratia, A. D. Barbour and Simon Tavare; 4. Positional games Jozsef Beck; 5. Degree distribution of competition-induced preferential attachment graphs N. Berger, C. Borgs, J. T. Chayes, R. M. D'Souza and R. D. Kleinberg; 6. On two conjectures on packing of graphs Bela Bollobas, Alexandr Kostochka and Kittikorn Nakprasit; 7. Approximate counting and quantum computation M. Bordewich, M. Freedman, L. Lovasz and D. Welsh; 8. Absence of zeros for the chromatic polynomial on bounded degree graphs Christian Borgs; 9. Duality in infinite graphs Henning Bruhn and Reinhard Diestel; 10. Homomorphism-homogeneous relational structures Peter J. Cameron and Jaroslav Ne?etril; 11. A spectral Turan theorem Fan Chung; 12. Automorphism groups of metacirculant graphs of order a product of two distinct primes Edward Dobson; 13. On the number of Hamiltonian cycles in a tournament Ehud Friedgut and Jeff Kahn; 14. The game of JumbleG Alan Frieze, Michael Krivelevich, Oleg Pikhurko and Tibor Szabo; 15. 2-Bases of quadruples Zoltan Fueredi and Gyula O. H. Katona; 16. On triple systems with independent neighbourhoods Zoltan Fueredi, Oleg Pikhurko and Miklos Simonovits; 17. Quasirandomness, counting and regularity for 3-uniform hypergraphs W. T. Gowers; 18. Triangle-free hypergraphs Ervin Gyori; 19. Odd independent transversals are odd Penny Haxell and Tibor Szabo; 20. The first eigenvalue of random graphs Svante Janson; 21. On the number of monochromatic solutions of x + y = z2 Ayman Khalfalah and Endre Szemeredi; 22. Rapid Steiner symmetrization of most of a convex body and the slicing problem B. Klartag and V. Milman; 23. A note on bipartite graphs wthout 2k-cycles Assaf Naor and Jacques Verstraete; 24. Book Ramsey numbers and quasi-eandomness V. Nikiforov, C. C. Rousseau and R. H. Schelp; 25. Homomorphism and dimension Patrice Ossona de Mendez and Pierre Rosenstiehl; 26. The distance of a permutation from a subgroup of Sn Richard G. E. Pinch; 27. On dimensions of a random solid diagram Boris Pittel; 28. The small giant component in scale-free random graphs Oliver Riordan; 29. A Dirac-type theorem for 3-uniform hypergraphs Vojtech Roedl, Andrzej Rucinski and Endre Szemeredi; 30. On dependency graphs and the lattice gas Alexander D. Scott and Alan D. Sokal; 31. Solving sparse random instances of max cut and max 2-CSP in linear expected time Alexander D. Scott and Gregory B. Sorkin.