A critical point for random graphs with a given degree sequence
Colouring graphs when the number of colours is nearly the maximum degree
Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC ’01
Random Structures & Algorithms
Michael Molloy
Uncovering the Small Community Structure in Large Networks
Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region