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
Rigidity of complements of bounded-degree graphs
Haslegrave, J
Michaeli, P
Nixon, A
(04 Sep 2026)
https://arxiv.org/abs/2609.05058v1
Greedy maximal independent sets via local limits
Krivelevich, M
Mészáros, T
Michaeli, P
Shikhelman, C
(16 Jul 2019)
https://arxiv.org/abs/1907.07216v6
The diameter of uniform spanning trees in high dimensions
Michaeli, P
Nachmias, A
Shalev, M
(27 Nov 2019)
https://arxiv.org/abs/1911.12319v1
Discrepancies of Spanning Trees and Hamilton Cycles
Gishboliner, L
Krivelevich, M
Michaeli, P
(09 Dec 2020)
https://arxiv.org/abs/2012.05155v2
Oriented discrepancy of Hamilton cycles
Gishboliner, L
Krivelevich, M
Michaeli, P
(14 Mar 2022)
https://arxiv.org/abs/2203.07148v2