Turán Colourings in Off-Diagonal Ramsey Multiplicity

• Published in: The Electronic journal of combinatorics Vol. 32; no. 2
• Main Authors: Hyde, Joseph, Lee, Jae-baek, Noel, Jonathan A.
• Format: Journal Article
• Language: English
• Published: 25.04.2025

The Ramsey multiplicity constant of a graph $H$ is the limit as $n$ tends to infinity of the minimum density of monochromatic labeled copies of $H$ in a $2$-edge colouring of $K_n$. Fox and Wigderson recently identified a large family of graphs whose Ramsey multiplicity constants are attained by seq...