Michael Krivelevich

Prof. Michael Krivelevich is the Baumritter Chair in Combinatorics at the School of Mathematical Sciences, Tel Aviv University, Israel. His research focuses on probabilistic and extremal combinatorics, random graphs, positional games, and theoretical computer science. He has authored foundational work on Hamiltonicity, Ramsey theory, and pseudo-random graphs.

• Email: krivelev@tauex.tau.ac.il
• Phone: +972 3 6405366
• Office: Schreiber, 301, Tel Aviv University

Research Interests

Prof. Krivelevich's work bridges probabilistic methods with deterministic graph properties, particularly in Hamilton cycles, extremal combinatorics, and position games. His research explores the structural properties of random and pseudo-random graphs, including connectivity, coloring, and subgraph packing. Recent studies focus on percolation thresholds, cycle distributions, and hereditary graph properties in random settings.

Article Trends

His recent publications emphasize Hamiltonian cycles in perturbed graphs, site percolation on hypercubes, and Turán-type problems for random subgraphs. Key themes include expanders, random graph processes, and game-theoretic graph resilience. Collaborations with leading researchers in combinatorics and algorithms underpin his interdisciplinary approach.

Scientific Awards

• Baumritter Chair in Combinatorics, Tel Aviv University

Teaching & Collaborations

He has taught courses including Random Graphs, Positional Games, and Graph Theory since 2002. Co-authored books and seminal papers with researchers like Noga Alon, Benny Sudakov, and Dan Hefetz have shaped modern combinatorics.