@InProceedings{dani_et_al:LIPIcs.APPROX/RANDOM.2021.59,
author = {Dani, Varsha and Gupta, Diksha and Hayes, Thomas P.},
title = {{On the Power of Choice for k-Colorability of Random Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)},
pages = {59:1--59:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-207-5},
ISSN = {1868-8969},
year = {2021},
volume = {207},
editor = {Wootters, Mary and Sanit\`{a}, Laura},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.59},
URN = {urn:nbn:de:0030-drops-147527},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.59},
annote = {Keywords: Random graphs, Achlioptas Processes, Phase Transition, Graph Colorability}
}