Michael Molloy

1. A critical point for random graphs with a given degree sequence
   1995/03/01 by Michael Molloy, Bruce Reed · 21 citations
2. Asymptotically good edge correspondence colouring
   2018/08/26 by Michael Molloy, Molloy, Michael, Postle, Luke · 3 citations
   Mathematics · Computer Science · Engineering · #Limits and Structures in Graph Theory #Advanced Graph Theory Research #graph theory and CDMA systems
3. The Satisfiability Threshold for a Seemingly Intractable Random\n Constraint Satisfaction Problem
   2012/01/31 by Harold Connamacher, Connamacher, Harold, Michael Molloy +1 · 1 citation
   Computer Science · #Advanced Algebra and Logic #Advanced Graph Theory Research #Constraint Satisfaction and Optimization #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge
4. The degree-restricted random process is far from uniform
   2022/11/02 by Michael Molloy, Molloy, Michael, Erlang Surya +3 · 1 citation
   Computer Science · Mathematics · #05C80 #60C05 #60G99 #68W20 #90B15 #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Markov Chains and Monte Carlo Methods #Probability (math.PR) #semigroups and automata theory