000			01078nam a22002657a 4500
008			220320b2002 |||||||| |||| 00| 0 eng d
020			_a9783540421399
082			_a514.223 MOL-M
100			_aMolloy, Michael
245			_aGraph colouring and the probabilistic method / _cMichael Molloy and Bruce Reed
260			_aBerlin _bSpringer _c2002
300			_a326p.
365			_aEU _b119.99
440			_aAlgorithms and combinatorics. _v23
500			_aOver 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.
650			_aCombinatorial analysis
650			_aProbabilities
650			_aGraph coloring
650			_aMap-coloring problem
650			_aMathematics
650			_aComputer science
650			_aComputer software
650			_aDistribution (Probability theory)
700			_aReed, Bruce
999			_c78474 _d78474