Combinatorics and Probability
by Edited by Graham Brightwell , Imre Leader , Alex Scott , Andrew ThomasonFormat: Hardcover
Pub. Date: 2007-04-09
Publisher(s): Cambridge University Press
Other versions by this Author
List Price: $190.00
Buy New
Usually Ships in 8 - 10 Business Days.
$189.81
Rent Textbook
Select for Price
Used Textbook
We're Sorry
Sold Out
eTextbook
We're Sorry
Not Available
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
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 Béla Bollobás 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 Béla Bollobás 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.
Table of Contents
| Preface | p. ix |
| Foreword | p. xi |
| Photographs | p. xx |
| Contributors | p. xxv |
| Measures of Pseudorandomness for Finite Sequences: Minimal Values | p. 1 |
| MaxCut in H-Free Graphs | p. 31 |
| A Tale of Three Couplings: Poisson-Dirichlet and GEM Approximations for Random Permutations | p. 51 |
| Positional Games | p. 83 |
| Degree Distribution of Competition-Induced Preferential Attachment Graphs | p. 132 |
| On Two Conjectures on Packing of Graphs | p. 157 |
| Approximate Counting and Quantum Computation | p. 171 |
| Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs | p. 189 |
| Duality in Infinite Graphs | p. 201 |
| Homomorphism-Homogeneous Relational Structures | p. 217 |
| A Spectral Turan Theorem | p. 231 |
| Automorphism Groups of Metacirculant Graphs of Order a Product of Two Distinct Primes | p. 245 |
| On the Number of Hamiltonian Cycles in a Tournament | p. 271 |
| The Game of JumbleG | p. 285 |
| 2-Bases of Quadruples | p. 297 |
| On Triple Systems with Independent Neighbourhoods | p. 309 |
| Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs | p. 329 |
| Triangle-Free Hypergraphs | p. 371 |
| Odd Independent Transversals are Odd | p. 379 |
| The First Eigenvalue of Random Graphs | p. 399 |
| On the Number of Monochromatic Solutions of x + y = z[superscript 2] | p. 413 |
| Rapid Steiner Symmetrization of Most of a Convex Body and the Slicing Problem | p. 429 |
| A Note on Bipartite Graphs Without 2k-Cycles | p. 445 |
| Book Ramsey Numbers and Quasi-Randomness | p. 451 |
| Homomorphism and Dimension | p. 461 |
| The distance of a permutation from a subgroup of S[subscript n] | p. 473 |
| On Dimensions of a Random Solid Diagram | p. 481 |
| The Small Giant Component in Scale-Free Random Graphs | p. 505 |
| A Dirac-Type Theorem for 3-Uniform Hypergraphs | p. 547 |
| On Dependency Graphs and the Lattice Gas | p. 571 |
| Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time | p. 599 |
| Table of Contents provided by Ingram. All Rights Reserved. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.