Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Molloy, M., Reed, B. (2002). The Method of Conditional Expectations. In: Graph Colouring and the Probabilistic Method. Algorithms and Combinatorics, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04016-0_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-04016-0_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04015-3
Online ISBN: 978-3-642-04016-0
eBook Packages: Springer Book Archive