Ramsey with purple edges

Abstract

Motivated by a question of Angell, we investigate a variant of Ramsey numbers where some edges are coloured simultaneously red and blue, which we call purple. Specifically, we are interested in the largest number g=g(n;s,t), for some s and t and n<R(s,t), such that there exists a red/blue/purple colouring of Kn with g purple edges, with no red/purple copy of Ks nor blue/purple copy of Kt. We determine g asymptotically for a large family of parameters, exhibiting strong dependencies with Ramsey-Tur\'an numbers.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…