Michael Molloy

Michael Molloy is a Professor (CS) at the University of Toronto, affiliated with the Department of Mathematics. His research interests are not specified in the available information. Prof. Molloy can be contacted via email at michael.molloy@utoronto.ca, and his profile page is accessible at https://www.mathematics.utoronto.ca/people/directories/all-faculty/michael-molloy.

Michael Molloy is a researcher at the University of Toronto, focusing on graph theory and probabilistic methods. His work explores random graphs, particularly the properties of graphs with given degree sequences, such as the size of the giant component and critical points. He investigates graph colouring, including chromatic numbers, strong chromatic indices, and total chromatic numbers. Molloy also examines algorithmic aspects of the local lemma and random constraint satisfaction problems. His research includes the analysis of list-coloring algorithms, frugal colouring, and frequency channel assignment on planar networks. Additionally, he studies cores in random hypergraphs and Boolean formulas, as well as perfect matchings in random hypergraphs.