World's Best Scientists 2026 revealed!
Michael Molloy

Michael Molloy

D-Index & Metrics

Computer Science

D-Index
34
Citations
7835
World Ranking
11945
National Ranking
464

Mathematics

D-Index
34
Citations
7736
World Ranking
2853
National Ranking
114

Research.com Recognitions

  • 2000 - Fellow of Alfred P. Sloan Foundation

Overview

Michael Molloy is a researcher affiliated with the University of Toronto in Canada, specializing in areas intersecting computer science and mathematics. Their work spans several related subfields, including computational theory and mathematics, discrete mathematics and combinatorics, molecular biology, electrical and electronic engineering, and statistics and probability.

The main topics covered in their research focus heavily on advanced graph theory and its applications. These topics include:

  • Advanced Graph Theory Research
  • Limits and Structures in Graph Theory
  • Graph Labeling and Dimension Problems
  • Graph theory and CDMA systems
  • Markov Chains and Monte Carlo Methods
  • Semigroups and Automata Theory
  • Gene Expression and Cancer Classification

Their publication record reflects contributions primarily to graph theory and related computational fields. Notable recent papers include:

  • "Asymptotically good edge correspondence colourings," 2022, Journal of Graph Theory
  • "Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model," 2025, Random Structures and Algorithms
  • "Adaptable and conflict colouring multigraphs with no cycles of length three or four," 2023, Journal of Graph Theory
  • "The degree-restricted random process is far from uniform," 2022, arXiv (Cornell University)
  • "Fractional Cocoloring of Graphs," 2022, Graphs and Combinatorics

The venues where their work most frequently appears include:

  • arXiv (Cornell University)
  • Journal of Graph Theory
  • Random Structures and Algorithms
  • Graphs and Combinatorics
  • Journal of Combinatorial Theory Series B

Michael Molloy collaborates with several researchers, having coauthored multiple papers with:

  • Jurgen Aliaj
  • Paweł Prałat
  • Gregory B. Sorkin
  • Erlang Surya
  • Lutz Warnke

The scope of Molloy's work reflects a multidisciplinary approach, crossing pure and applied mathematical methods within computer science contexts. The research topics indicate engagement with both theoretical underpinnings and practical algorithms related to graph theory and combinatorics, as well as connections to biological data analysis patterns.

Among the recognitions awarded to Michael Molloy is the title of Fellow of the Alfred P. Sloan Foundation, granted in 2000.

Best Publications

  • A critical point for random graphs with a given degree sequence

    Michael Molloy;Bruce Reed

  • The Size of the Giant Component of a Random Graph with a Given Degree Sequence

    Michael Molloy;Bruce Reed

  • Further algorithmic aspects of the local lemma

    Michael Molloy;Bruce Reed

  • A bound on the chromatic number of the square of a planar graph

    Michael Molloy;Mohammad R. Salavatipour

  • A Bound on the Strong Chromatic Index of a Graph

    Michael Molloy;Bruce Reed

  • Random constraint satisfaction: a more accurate picture

    Dimitris Achlioptas;Lefteris M. Kirousis;Evangelos Kranakis;Danny Krizanc

  • Cores in random hypergraphs and Boolean formulas

    Michael Molloy

  • A Bound on the Total Chromatic Number

    Michael Molloy;Bruce A. Reed

  • The analysis of a list-coloring algorithm on a random graph

    D. Achlioptas;M. Molloy

  • The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree

    Michael Molloy

  • Colouring a graph frugally

    Hugh Hind;Michael Molloy;Bruce A. Reed

  • Frequency channel assignment on planar networks

    Michael Molloy;Mohammad R. Salavatipour

  • Perfect Matchings in Random r -regular, s -uniform Hypergraphs

    Colin Cooper;Alan M. Frieze;Michael Molloy;Bruce A. Reed

  • The list chromatic number of graphs with small clique number

    Michael Molloy

  • Generating and Counting Hamilton Cycles in Random Regular Graphs

    Alan Frieze;Mark Jerrum;Michael Molloy;Robert Robinson

  • Models for Random Constraint Satisfaction Problems

    Michael Molloy

  • A sharp threshold in proof complexity

    Dimitris Achlioptas;Paul Beame;Michael Molloy

  • Random Constraint Satisfaction: A More Accurate Picture

    Dimitris Achlioptas;Michael S. O. Molloy;Lefteris M. Kirousis;Yannis C. Stamatiou

  • 1-factorizations of random regular graphs

    M. S. O. Molloy;H. Robalewska;R. W. Robinson;N. C. Wormald

  • Finding optimal satisficing strategies for and-or trees

    Russell Greiner;Ryan Hayward;Magdalena Jankowska;Michael Molloy

  • The Probabilistic Method

    Michael Molloy

  • Hadwiger’s Conjecture

    Michael Molloy;Bruce Reed

Frequent Co-Authors

Bruce Reed
Bruce Reed McGill University
Dimitris Achlioptas
Dimitris Achlioptas National and Kapodistrian University of Athens
Alan Frieze
Alan Frieze Carnegie Mellon University
Cristopher Moore
Cristopher Moore Santa Fe Institute
Noga Alon
Noga Alon Tel Aviv University
Paul Beame
Paul Beame University of Washington
Evangelos Kranakis
Evangelos Kranakis Carleton University
Shahram Izadi
Shahram Izadi Google (United States)
Russell Greiner
Russell Greiner University of Alberta
Abigail Sellen
Abigail Sellen Microsoft (United States)

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Mathematics in the USA opens doors to diverse career paths, including finance, technology, and data science. For those looking to complement their math background, pursuing an MBA can enhance leadership and business skills. Many students explore 1 year mba programs that offer accelerated paths to management roles, balancing rigorous coursework with career advancement.

Transferring credits is a common concern for professionals seeking flexibility. Fortunately, there are numerous can you transfer mba programs options, allowing students to save time and money by building on previous academic achievements.

For those focused on data-driven careers, combining a math degree with a specialized graduate degree can be highly effective. Exploring the best masters in data analytics programs provides access to cutting-edge skills in interpreting complex data sets and making informed decisions in various industries.

Additionally, some students prioritize ease of admission to balance education with other responsibilities. The easiest mba program to get into can be a strategic choice for gaining credentials without the stress of competitive entry requirements.

Best Scientists Citing Michael Molloy

Trending Scientists