Fingerprint
Dive into the research topics where Michael Krivelevich is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Large Matchings and nearly Spanning, nearly Regular Subgraphs of Random Subgraphs
Diskin, S., Erde, J., Kang, M. & Krivelevich, M., 2026, In: Electronic Journal of Combinatorics. 33, 1, P1.37.Research output: Contribution to journal › Article › peer-review
Open Access -
Minimum degree conditions for graph rigidity
Krivelevich, M., Lew, A. & Michaeli, P., Jan 2026, In: Bulletin of the London Mathematical Society. 58, 1, e70279.Research output: Contribution to journal › Article › peer-review
-
On Independent Spanning Trees in Random Graphs
Draganić, N., Frankston, K., Krivelevich, M., Pokrovskiy, A. & Yepremyan, L., 2026, Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026. Larsen, K. G. & Saha, B. (eds.). Association for Computing Machinery, p. 4096-4104 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2026-January).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
On the edge expansion of random polytopes
Ferber, A., Krivelevich, M., Sales, M. & Samotij, W., 2026, Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026. Larsen, K. G. & Saha, B. (eds.). Association for Computing Machinery, p. 3022-3035 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2026-January).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Coloring Graphs From Random Lists
Hefetz, D. & Krivelevich, M., Jan 2025, In: Random Structures and Algorithms. 66, 1, e21278.Research output: Contribution to journal › Article › peer-review