معرفی
Prof. Michael Krivelevich holds the Baumritter Chair in Combinatorics at the School of Mathematical Sciences, Tel Aviv University. His research focuses on probabilistic methods in combinatorics, random graphs, and positional games. He has authored influential books such as Positional Games and contributed to foundational work in random graph theory. Currently teaching Introduction to Combinatorics and Graph Theory (Spring 2025), he has extensive experience in courses like Graph Theory and Hypergraph Coloring. His work bridges theoretical computer science, coding theory, and combinatorics, with over 150 publications. Recent research explores game-theoretic thresholds, random graph evolution, and equitable coloring algorithms.
- Education: Ph.D. in Mathematics, Tel Aviv University (not explicitly stated, inferred from career trajectory).
Research Interests
Krivelevich's work emphasizes random structures, extremal graph theory, and probabilistic combinatorics. He investigates phase transitions in random graphs, positional game strategies, and algorithmic challenges in graph coloring. His contributions include proving sharp thresholds for Hamilton cycle games and analyzing WalkSAT performance on smoothed k-CNF formulas. Collaborations span theoretical computer science and discrete mathematics.
Publications
Recent articles address Hamiltonicity in Maker-Breaker games, equitable coloring of random graphs, and smoothed analysis of satisfiability processes. His work often combines rigorous proofs with algorithmic insights.
Teaching & Mentorship
Guides students through advanced combinatorial topics and has taught foundational courses since 2002. No explicit student listings available in provided texts.
