Thursday, June 15
CP12
Probabilistic Combinatorics
3:30 pm - 5:30 pm
Room: Section B
Chair: Ben Gum, Princeton University, USA
- 3:30 - 3:45 The Secretary Problem with a Uniform Distribution
- Ben Gum, Princeton University, USA
- 3:50 - 4:05 Weak Thresholds in the Evolution of Random Structures
- Gregory McColm, University of South Florida, USA
- 4:10 - 4:25 Acyclic Edge Colorings of Graphs
- Noga Alon, Tel Aviv University, Tel Aviv, Israel; Benny Sudakov, Princeton University, USA; and Ayal Zaks, Tel Aviv University, Israel
- 4:30 - 4:45 How to Get a Cover Graph?
- Vojtech Rödl, Emory University, USA; and Lubos Thoma, Carnegie Mellon University, USA
- 4:50 - 5:05 Cancelled
Equivalent Conditions of Regularity
Yoshiharu Kohayakawa, University of Sao Paulo, Brasil; and Vojtech Rödl and Jozef Skokan, Emory University, USA
- 5:10 - 5:25 Equitable Colorings Lead to Generalized Chernoff-Hoeffding Bounds
- Sriram V. Pemmaraju, Indian Institute of Technology, India