Projects per year

## Abstract

We prove that (Formula presented.), where (Formula presented.) is the Ramsey parameter introduced by Burr, Erdős and Lovász in 1976, which is defined as the smallest minimum degree of a graph (Formula presented.) such that any (Formula presented.) -colouring of the edges of (Formula presented.) contains a monochromatic (Formula presented.), whereas no proper subgraph of (Formula presented.) has this property. The construction used in our proof relies on a group theoretic model of generalised quadrangles introduced by Kantor in 1980.

Original language | English |
---|---|

Pages (from-to) | 1827-1838 |

Number of pages | 12 |

Journal | Bulletin of the London Mathematical Society |

Volume | 54 |

Issue number | 5 |

Early online date | 15 Apr 2022 |

DOIs | |

Publication status | Published - Oct 2022 |

## Fingerprint

Dive into the research topics of 'The minimum degree of minimal Ramsey graphs for cliques'. Together they form a unique fingerprint.## Projects

- 1 Finished