Coloring Random Graphs is a theoretical framework in graph theory that prescribes methods for assigning colors to the vertices of randomly generated graphs such that no two adjacent vertices share the same color, distinguishing it from deterministic graph coloring by incorporating probabilistic analysis and phase transition phenomena inherent to random graph models.
226
Publications
9.5K
Citations
341
Authors
214
Institutions
Publications per year
2017–2026
30
Parents
Publications
226
Phase transitions in the coloring of random graphs
Lenka Zdeborová, Florent Krząkała · Physical Review E · 2007 · 305 citations · Full text
Improved bounds for sampling colorings
Eric Vigoda · Journal of Mathematical Physics · 2000 · 217 citations
1–5 of 226
Authors
341
- AF
12
h-index
- MD
8
h-index
- JH
8
h-index
- EV
8
h-index
- BS
6
h-index
1–5 of 341
Institutions
214
Carnegie Mellon University
Pittsburgh, United States
12 h-index
20 publications
573 citations
Centre National de la Recherche Scientifique
Paris, France
11 h-index
23 publications
1.2K citations
Tel Aviv University
Tel Aviv, Israel
11 h-index
15 publications
600 citations
University of Leeds
Leeds, United Kingdom
8 h-index
10 publications
466 citations
Université d'Angers
Angers, France
8 h-index
17 publications
1.2K citations
ETH Zurich
Zurich, Switzerland
7 h-index
19 publications
366 citations
University of Edinburgh
Edinburgh, United Kingdom
7 h-index
8 publications
703 citations
University of Oxford
Oxford, United Kingdom
7 h-index
10 publications
203 citations
1–8 of 214
Venues
- Random Structures and Algorithms
21 publications · 652 citations
15
h-index
- COMBINATORICA
11 publications · 606 citations
11
h-index
- arXiv (Cornell University)
Repository · 10 publications · 264 citations
10
h-index
- Combinatorics Probability Computing
12 publications · 290 citations
10
h-index
- Discrete Mathematics
10 publications · 169 citations
10
h-index
1–5