Peleg Michaeli

activity

20242026

collaborators

8 papers

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…

math.CO2026

Defect and transference versions of the Alon-Frankl-Lovasz theorem

Lior Gishboliner, Stefan Glock, Peleg Michaeli +1

Confirming a conjecture of ErdÅs on the chromatic number of Kneser hypergraphs, Alon, Frankl and LovÃ¡sz proved that in any $q$ -colouring of the edges of the complete $r$ -uniform…

math.CO2025

A generalised Ramsey--TurÃ¡n problem for matchings

Peter Keevash, Peleg Michaeli

We prove a generalised Ramsey--TurÃ¡n theorem for matchings, which (a) simultaneously generalises the Cockayne--Lorimer Theorem (Ramsey for matchings) and the ErdÅs--Gallai Theore…

math.CO2025

Karp's patching algorithm on random perturbations of dense digraphs

Alan Frieze, Peleg Michaeli

We consider the following question. We are given a dense digraph $D_{0}$ with minimum in- and out-degree at least $I^\pm n$ , where $I^\pm > 0$ is a constant. We then add random edges $R$ to $…