Home Science Off-Diagonal Ramsey Multiplicity
Science

Off-Diagonal Ramsey Multiplicity

Key Points

arXiv:2306.17388v2 Announce Type: replace-cross Abstract: The Ramsey multiplicity problem asks for the minimum asymptotic density of monochromatic labelled copies of a graph $H$ in a red/blue colouring of the edges of $K_n$. We introduce an off-diagonal generalization in which the goal is to minimize a certain weighted sum of the densities of red copies of one graph and blue copies of another. We build up various properties of this new notion, including a useful "dual formulation," and use...

arXiv:2306.17388v2 Announce Type: replace-cross Abstract: The Ramsey multiplicity problem asks for the minimum asymptotic density of monochromatic labelled copies of a graph $H$ in a red/blue colouring of the edges of $K_n$. We introduce an off-diagonal generalization in which the goal is to minimize a certain weighted sum of the densities of red copies of one graph and blue copies of another. We build up various properties of this new notion, including a useful "dual formulation," and use these results to solve the problem for several pairs of graphs.
Off-Diagonal Ramsey Multiplicity (ORG) Ramsey (PERSON)
Originally published by arXiv CS Read original →