On the trace of random walks on random graphs
Frieze, A
Krivelevich, M
Michaeli, P
Peled, R
(28 Aug 2015)
https://arxiv.org/abs/1508.07355v2
Thresholds in random motif graphs
Anastos, M
Michaeli, P
Petti, S
(28 Jul 2019)
https://arxiv.org/abs/1907.12043v1
Minimum degree conditions for graph rigidity
Krivelevich, M
Lew, A
Michaeli, P
(18 Dec 2024)
https://arxiv.org/abs/2412.14364v1
Defect and transference versions of the Alon-Frankl-Lovasz theorem
Gishboliner, L
Glock, S
Michaeli, P
Sgueglia, A
(07 Mar 2025)
https://arxiv.org/abs/2503.05089v2
Rigidity of expanders and pseudorandom graphs
Krivelevich, M
Lew, A
Michaeli, P
(21 Aug 2026)
https://arxiv.org/abs/2608.21058v1
Small subgraphs in the trace of a random walk
Krivelevich, M
Michaeli, P
(15 May 2016)
https://arxiv.org/abs/1605.04585v2
Colour-biased Hamilton cycles in random graphs
Gishboliner, L
Krivelevich, M
Michaeli, P
(23 Jul 2020)
https://arxiv.org/abs/2007.12111v4
Spanning trees at the connectivity threshold
Alon, Y
Krivelevich, M
Michaeli, P
(29 Oct 2020)
https://arxiv.org/abs/2010.15519v2
Rigid partitions: from high connectivity to random graphs
Krivelevich, M
Lew, A
Michaeli, P
(24 Nov 2023)
https://arxiv.org/abs/2311.14451v2
Combinatorial sufficient conditions for graph rigidity and applications to random graphs
Krivelevich, M
Lew, A
Michaeli, P
(27 Feb 2026)
https://arxiv.org/abs/2602.23713v1