Skip to content

Author

Michael Krivelevich

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Long induced cycles in pseudorandom graphs

We show that, for some absolute constants $c_1,c_2>0$, every $(n,d,\lambda)$-graph with $\lambda\le c_1 d$ contains an induced cycle of length at least $c_2n\log(d/\lambda)/d$. This is best possible up to the values of $c_1,c_2$. Our techniques include a multi-scale algorithmic analysis, an adapted depth-first explorat...

Sahar Diskin, Lyuben Lichev, Michael Krivelevich et al. · 1 citation
Preprint Aug 2026

Rigidity of expanders and pseudorandom graphs

A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, the only continuous motions of the vertices preserving the distances between all pairs of adjacent vertices are those induced from the isometries of $\mathbb{R}^d$ (that is, translations and rotations of the whole graph...

Michael Krivelevich, Alan Lew, Peleg Michaeli · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.