Image from Amazon.com
Graph colouring and the probabilistic method / Michael Molloy and Bruce Reed
Material type:
TextSeries: Algorithms and combinatorics ; 23Publication details: Berlin Springer 2002Description: 326pISBN: - 9783540421399
- 514.223 MOL-M
| Item type | Current library | Collection | Shelving location | Call number | Status | Notes | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|---|---|---|
Books
|
BITS Pilani Hyderabad | 510 | General Stack (For lending) | 514.223 MOL-M (Browse shelf(Opens below)) | Checked out | RIG Project Book : Dr. Sajjith | 23/01/2025 | 44916 |
Total holds: 0
Browsing BITS Pilani Hyderabad shelves, Shelving location: General Stack (For lending), Collection: 510 Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 514.2 SHA-A Basic algebraic topology / | 514.2 WEI-S Fundamentals of algebraic topology / | 514.22 PRA-V Elements of combinatorial and differential topology / | 514.223 MOL-M Graph colouring and the probabilistic method / | 514.224 BRE-G Sheaf theory / | 514.224 SOS-A Knots : mathematics with a twist / | 514.2242 ADA-C Knot book : an elementary introduction to the mathematical theory of knots |
Over the past decade, many major advances have been made in the field of graph colouring via the probabilistic method. This monograph, by two of the best on the topic, provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality.
There are no comments on this title.
Log in to your account to post a comment.