This is the authors' abstract. We don't add key points for this paper.
We prove that s r ( K k ) = O ( k 5 r 5 / 2 ) sᵣ(Kₖ) = O(k⁵ r5/2) , where s r ( K k ) sᵣ(Kₖ) 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 G G such that any r r -colouring of the edges of G G contains a monochromatic K k Kₖ , whereas no proper subgraph of G G has this property. The construction used in our proof relies on a group theoretic model of generalised quadrangles introduced by Kantor in 1980.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Bamberg et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: