5 papers · 1 filter
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…
On subsets of lattice cubes avoiding affine and spherical degeneracies
Anubhab Ghosal, Ritesh Goenka, Peter Keevash
For integers and , we establish new lower bounds on the maximum number of points in such that no lie in a -dimensional affine (or linear) su…
Dissipative particle systems on expanders
John Haslegrave, Peter Keevash
We consider a general framework for multi-type interacting particle systems on graphs, where particles move one at a time by random walk steps, different types may have different s…
Cyclic subsets in regular Dirac graphs
Nemanja DraganiÄ, Peter Keevash, Alp Müyesser
In 1996, in his last paper, ErdÅs asked the following question that he formulated together with Faudree: is there a positive such that any -regular graph on ve…
Pósa rotation through a random permutation
Nemanja DraganiÄ, Peter Keevash
What minimum degree of a graph on vertices guarantees that the union of and a random -factor (or permutation) is with high probability Hamiltonian? Girão and Espuny…