This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Michael Krivelevich | |
|---|---|
| Name | Michael Krivelevich |
| Occupation | Mathematician |
| Known for | Combinatorics, Extremal Graph Theory, Probabilistic Method |
Michael Krivelevich
Michael Krivelevich is an Israeli mathematician noted for contributions to Extremal graph theory, Probabilistic method, and Combinatorics broadly, with influential work intersecting Random graphs, Ramsey theory, Positional games, and Property testing. He holds academic appointments and has collaborated with researchers across institutions including Tel Aviv University, Princeton University, MIT, and University of Cambridge.
Krivelevich was born and raised in Moscow, where he attended schools tied to institutions such as the Moscow State University feeder programs and later moved to Israel to pursue higher education at Tel Aviv University and connections with research groups at Hebrew University of Jerusalem and Weizmann Institute of Science. He completed doctoral studies under advisors connected to networks of researchers from Erdős-era collaborations and training lines linked to Paul Erdős, Noga Alon, and scholars based at Princeton University and European Research Council-funded centers. During his formative years he engaged with seminars at organizations including the American Mathematical Society, Institute for Advanced Study, and workshops hosted by CIRM and MSRI.
Krivelevich has held professorial roles at Tel Aviv University and visiting positions at institutions like Princeton University, Massachusetts Institute of Technology, University of Cambridge, ETH Zurich, and Institut Henri Poincaré. He served on program committees for conferences organized by SIAM, European Combinatorics Conference, International Congress of Mathematicians satellites, and symposia sponsored by European Mathematical Society and Israel Science Foundation. His supervisory network includes doctoral students and postdoctoral researchers who have taken positions at Harvard University, Stanford University, University of Oxford, UC Berkeley, and research labs affiliated with Google Research and Microsoft Research.
Krivelevich's research advanced topics in Ramsey theory, Hamiltonian cycles, Random graph process, Percolation theory, and the Positional games framework, producing results that linked ideas from Paul Erdős's probabilistic method to structural theorems in Graph theory. He proved influential theorems on resilience of properties in G(n,p) random graphs, connected results on Hamiltonicity with studies from Dirac-type conditions and extensions inspired by work of Bollobás and Komlós. His collaborations yielded breakthroughs on Maker–Breaker games building on frameworks by Hefetz, Beck, and Bednarska-Bzdȩga, and on thresholds for connectivity and matchings influenced by research from Łuczak and Ajtai. He contributed to the theory of sparse pseudorandom graphs, relating to spectral approaches from Alon and Chung, and produced extremal bounds resonant with conjectures of Erdős and Sós. His work on embedding spanning structures in random and pseudorandom settings connects to studies by Krivelevich, Sudakov collaborators and to probabilistic combinatorics advances promoted at MSRI and Institut Henri Poincaré programs.
Krivelevich received recognition from bodies such as the Israel Prize-adjacent academic awards, grants from the European Research Council and the Israel Science Foundation, and invitations to present at plenary and invited sessions of the European Congress of Mathematics and the International Congress of Mathematicians satellite meetings. He has held fellowships and visiting researcher positions at the Institute for Advanced Study, and his papers have been cited in works honored by prizes associated with the American Mathematical Society and the London Mathematical Society.
- Articles in journals including the Journal of Combinatorial Theory, Series B, Combinatorica, Random Structures & Algorithms, and Proceedings of the London Mathematical Society on topics of Random graphs, Hamiltonian cycles, and Extremal graph theory. - Collaborative papers with researchers such as Noga Alon, Béla Bollobás, Alan Frieze, and Benny Sudakov addressing Positional games, resilience, and embedding problems in sparse graphs. - Survey articles and chapters appearing in volumes associated with MSRI and CIME summer schools on developments in Probabilistic combinatorics and Extremal combinatorics.
Outside mathematics, Krivelevich has participated in organizing conferences at venues like Tel Aviv University and Weizmann Institute of Science, engaged with outreach efforts linked to the European Mathematical Society and national science initiatives in Israel, and contributed to editorial boards of journals published by Elsevier, Springer Nature, and the London Mathematical Society. He maintains collaborations spanning networks including Princeton University, Stanford University, ETH Zurich, and research groups funded by the European Research Council.
Category:Israeli mathematicians Category:Combinatorialists