Peleg Michaeli

activity

20152026

most citedColour-biased Hamilton cycles in random graphs

7 citations · 14 across the 15 of their papers we have counts for

collaborators

Showing 2026Show all

4 papers · 1 filter

math.CO2026

Rigidity of complements of bounded-degree graphs

John Haslegrave, Peleg Michaeli, Anthony Nixon

Maxwell observed that the graph of any rigid generic framework in $R^{d}$ on $n$ vertices has at least $d n - (2 d + 1)$ edges. In this article we prove that graphs whose…

math.CO2026

Rigidity of expanders and pseudorandom graphs

Michael Krivelevich, Alan Lew, Peleg Michaeli

A graph $G = (V, E)$ is called $d$ -rigid if, for a generic embedding of its vertices in $R^{d}$ , the only continuous motions of the vertices preserving the distances between al…

math.CO2026

A very robust Ramsey theorem for matchings

Peter Keevash, Peleg Michaeli

Our main result is a robust generalisation of the Cockayne-Lorimer theorem on the multicolour Ramsey number of matchings. It is moreover a generalisation of the transference genera…

math.CO2026

Combinatorial sufficient conditions for graph rigidity and applications to random graphs

Michael Krivelevich, Alan Lew, Peleg Michaeli

A graph $G = (V, E)$ is called $d$ -rigid if, for a generic embedding of its vertices in $R^{d}$ , every edge-length preserving continuous motion of the vertices preserves the di…