Small Subgraphs in the Trace of a Random Walk. - Michael Krivelevich; Peleg Michaeli (Electron. J. Comb., 2017)

Thresholds in Random Motif Graphs. - Michael Anastos; Peleg Michaeli; Samantha Petti (APPROX-RANDOM, 2019)

Discrepancies of spanning trees and Hamilton cycles. - Lior Gishboliner; Michael Krivelevich; Peleg Michaeli (J. Comb. Theory B, 2022)

Color-biased Hamilton cycles in random graphs. - Lior Gishboliner; Michael Krivelevich; Peleg Michaeli (Random Struct. Algorithms, 2022)

Spanning Trees at the Connectivity Threshold. - Yahav Alon; Michael Krivelevich; Peleg Michaeli (SIAM J. Discret. Math., 2022)

Oriented discrepancy of Hamilton cycles. - Lior Gishboliner; Michael Krivelevich; Peleg Michaeli (J. Graph Theory, 2023)

Greedy maximal independent sets via local limits. - Michael Krivelevich; Tamás Mészáros 001; Peleg Michaeli; Clara Shikhelman (Random Struct. Algorithms, 2024)

Rigid partitions: From high connectivity to random graphs. - Michael Krivelevich; Alan Lew; Peleg Michaeli (J. Comb. Theory B, 2025)