We study the graph coloring problem over random graphs of finite average connectivity c.
Given a number q of available colors, we find that graphs with low connectivity admit almost …

We study the graph coloring problem over random graphs of finite average connectivity c.
Given a number q of available colors, we find that graphs with low connectivity admit almost …

We consider the problem of coloring the vertices of a large sparse random graph with a
given number of colors so that no adjacent vertices have the same color. Using the cavity …

We consider the problem of coloring Erdös-Rényi and regular random graphs of finite
connectivity using q colors. It has been studied so far using the cavity approach within the so …

The problem of vertex coloring in random graphs is studied using methods of statistical
physics and probability. Our analytical results are compared to those obtained by exact …

We study the evolution of the chromatic number of a random intersection graph and show
that, in a certain range of parameters, these random graphs can be colored optimally with …

Based on a non-rigorous formalism called the “cavity method”, physicists have put forward
intriguing predictions on phase transitions in diluted mean-field models, in which the …

Color‐biased Hamilton cycles in random graphs - Gishboliner - 2022 - Random Structures &
Algorithms - Wiley Online Library Skip to Article Content Skip to Article Information Wiley Online …

We derive a message-passing method for computing the spectra of locally treelike networks
and an approximation to it that allows us to compute closed-form expressions or fast …

We study the phase transition in a random graph in which vertices and edges are added at
constant rates. Two recent papers in Physical Review E by Callaway, Hopcroft, Kleinberg …