Off-Diagonal Ramsey Multiplicity
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 Kn. 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.