pdf-format: |
|
@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:1--36:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-125-2}, ISSN = {1868-8969}, year = {2019}, volume = {145}, editor = {Dimitris Achlioptas and L{\'a}szl{\'o} A. V{\'e}gh}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11251}, URN = {urn:nbn:de:0030-drops-112513}, doi = {10.4230/LIPIcs.APPROX-RANDOM.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: | 17.09.2019 |