Go to the corresponding LIPIcs Volume Portal 
Anastos, Michael ; Frieze, Alan
pdfformat: 

@InProceedings{anastos_et_al:LIPIcs:2019:11251, author = {Michael Anastos and Alan Frieze}, title = {{On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)}, pages = {36:136:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771252}, ISSN = {18688969}, year = {2019}, volume = {145}, editor = {Dimitris Achlioptas and L{\'a}szl{\'o} A. V{\'e}gh}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11251}, URN = {urn:nbn:de:0030drops112513}, doi = {10.4230/LIPIcs.APPROXRANDOM.2019.36}, annote = {Keywords: Random Graphs, Colorings, Ergodicity} }
Keywords:  Random Graphs, Colorings, Ergodicity  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)  
Issue Date:  2019  
Date of publication:  19.09.2019 