Michael Krivelevich - Selected Publications#

Books:

D. Hefetz, M. Krivelevich, M. Stojakovic and T. Szabo, Positional Games, Birkhauser 2014.

M. Krivelevich, K. Panagiotou, M. Penrose and C. McDiarmid, Random Graphs, Geometry and Asymptotic Structure, London Mathematical Society Student Texts 84,
Cambridge University Press 2016.

Papers:

N. Alon, M. Krivelevich and B. Sudakov, Finding a large hidden clique in a random graph, Proceedings of the 9th Symposium on Discrete Algorithms (SODA’98), 594–598.
Also: Random Structures and Algorithms, 13 (1998), 457–466.

N. Alon, E. Fischer, M. Krivelevich and M. Szegedy, Efficient testing of large graphs, Proceedings of the 40th Symposium on Foundations of Computer Science (FOCS’99), 656–666.
Also: Combinatorica 20 (2000), 451–476.

N. Alon, T. Kaufman, M. Krivelevich, S. Litsyn and D. Ron, Testing Reed-Miller codes, IEEE Transactions on Information Theory 51 (2005), 4032–4039.

M. Krivelevich and B. Sudakov, Minors in expanding graphs, Geometric and Functional Analysis 19 (2009), 294–331.

M. Krivelevich, The critical bias for the Hamiltonicity game is (1 + o(1))n/ ln n, Journal of the American Mathematical Society 24 (2011), 125–131.

M. Krivelevich, C. Lee and B. Sudakov, Robust Hamiltonicity of Dirac graphs, Transactions of the American Mathematical Society 366 (2014), 3095–3130.

M. Krivelevich, Long cycles in locally expanding graphs, with applications, Combinatorica 39 (2019), 135–151.

M. Krivelevich, Expanders - how to find them, and what to find in them, In: Surveys in Combinatorics 2019, London Mathematical Society Lecture Note Series 456, pp. 115–142.