A. Coja-Oghlan

activity

20032023

most citedAlgorithmic barriers from phase transitions

162 citations · 853 across the 40 of their papers we have counts for

collaborators

Showing 2015 · math.COShow all

2 papers · 2 filters

math.CO2015

How does the core sit inside the mantle?

Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang +1

The $k$ -core, defined as the largest subgraph of minimum degree $k$ , of the random graph $G (n, p)$ has been studied extensively. In a landmark paper Pittel, Wormald and Spencer [JCT…

math.CO2015

Local convergence of random graph colorings

Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari

Let $G = G (n, m)$ be a random graph whose average degree $d = 2 m / n$ is below the $k$ -colorability threshold. If we sample a $k$ -coloring $σ$ of $G$ uniformly at random, what can we say…