2002 | OriginalPaper | Chapter
The Method of Conditional Expectations
Authors : Michael Molloy, Bruce Reed
Published in: Graph Colouring and the Probabilistic Method
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Throughout this chapter, we consider hypergraphs for which the expected number of monochromatic edges in a uniformly random 2-colouring is less than one. To begin, we present an efficient algorithm, due to Erdős and Selfridge [46] for finding proper 2-colourings of such hypergraphs.