### Abstract

The use of randomness is now an accepted tool in Theoretical Computer Science but not everyone is aware of the underpinnings of this methodology in Combinatorics - particularly, in what is now called the Probabilistic Method as developed primarily by Paul Erdös over the past half century. Here I will explore a particular set of problems - all dealing with "good" colorings of an underlying set of points relative to a given family of sets. A central point will be the evolution of these problems from the purely existential proofs of Erdös to the algorithmic aspects of much interest to this audience.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992 |

Publisher | Association for Computing Machinery |

Pages | 41-47 |

Number of pages | 7 |

Volume | Part F129721 |

ISBN (Electronic) | 089791466X |

State | Published - Sep 1 1992 |

Event | 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992 - Orlando, United States Duration: Jan 27 1992 → Jan 29 1992 |

### Other

Other | 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992 |
---|---|

Country | United States |

City | Orlando |

Period | 1/27/92 → 1/29/92 |

### Fingerprint

### ASJC Scopus subject areas

- Software
- Mathematics(all)

### Cite this

*Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992*(Vol. Part F129721, pp. 41-47). Association for Computing Machinery.

**The probabilistic method.** / Spencer, Joel.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992.*vol. Part F129721, Association for Computing Machinery, pp. 41-47, 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992, Orlando, United States, 1/27/92.

}

TY - GEN

T1 - The probabilistic method

AU - Spencer, Joel

PY - 1992/9/1

Y1 - 1992/9/1

N2 - The use of randomness is now an accepted tool in Theoretical Computer Science but not everyone is aware of the underpinnings of this methodology in Combinatorics - particularly, in what is now called the Probabilistic Method as developed primarily by Paul Erdös over the past half century. Here I will explore a particular set of problems - all dealing with "good" colorings of an underlying set of points relative to a given family of sets. A central point will be the evolution of these problems from the purely existential proofs of Erdös to the algorithmic aspects of much interest to this audience.

AB - The use of randomness is now an accepted tool in Theoretical Computer Science but not everyone is aware of the underpinnings of this methodology in Combinatorics - particularly, in what is now called the Probabilistic Method as developed primarily by Paul Erdös over the past half century. Here I will explore a particular set of problems - all dealing with "good" colorings of an underlying set of points relative to a given family of sets. A central point will be the evolution of these problems from the purely existential proofs of Erdös to the algorithmic aspects of much interest to this audience.

UR - http://www.scopus.com/inward/record.url?scp=0039963923&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0039963923&partnerID=8YFLogxK

M3 - Conference contribution

VL - Part F129721

SP - 41

EP - 47

BT - Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992

PB - Association for Computing Machinery

ER -