Tight asymptotics of clique-chromatic numbers of dense random graphs.

Yury Demidovich Maksim Zhukovskii

Published in: J. Graph Theory (2023)

Keyphrases

random graphs
quasi cliques
graph theoretic
lower bound
upper bound
phase transition
learning curves
sufficient conditions
markov chain
small world
color images
undirected graph
power law
complex networks
search algorithm
graph mining
worst case
attributed graphs
computational complexity