Abstract
Considering a natural generalization of the Ruzsa-Szemerédi problem, we prove that for any fixed positive integers with , there are graphs on vertices containing copies of such that any is contained in at most one . We also give bounds for the generalized rainbow Turán problem rainbow- when is complete. In particular, we answer a question of Gerbner, Mészáros, Methuku and Palmer, showing that there are properly edge-coloured graphs on vertices with copies of such that no is rainbow.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.