K4--free triple systems without large stars in the complement

Abstract

The n-star Sn is the n-vertex triple system with n-1 2 edges all of which contain a fixed vertex, and K4- is the unique triple system with four vertices and three edges. We prove that the Ramsey number r(K4-, Sn) has order of magnitude n2 / n. This confirms a conjecture of Conlon, Fox, He, Suk, Verstra\"ete and the first author. It also generalizes the well-known bound of Kim for the graph Ramsey number r(3,n), as the link of any vertex in a K4--free triple system is a triangle-free graph. Our method builds on the approach of Guo and Warnke who adapted Kim's lower bound for r(3,n) to the pseudorandom setting.

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…