This is the authors' abstract. We don't add key points for this paper.
Recently, Heath, McCourt, Parker, Schwieder, and Zerbib [4] initiated the systematic study of the r-Kneser Ramsey number R r K G ( s , t ) and investigated related Ramsey-type problems. A central motivation for their work comes from a question of Holmsen, Hrusak, and Roldán-Pensado, who asked whether, for n = 2 k − 1 and sufficiently large k , every red/blue edge-coloring of the complete graph on the vertex set V = ( [ n ] k ) necessarily contains a monochromatic triangle ABC with A , B , C ∈ V and A ∩ B ∩ C = ∅ . Heath, McCourt, Parker, Schwieder, and Zerbib established that this conclusion holds when n ≥ 7 k 3 and k ≥ 12 . We make substantial progress toward the problem of Holmsen, Hrusak, and Roldán-Pensado by proving that the conclusion already holds for every k ≥ 2 whenever n ≥ 2 k + 1 . In addition, we obtain improved lower bounds for R r K G ( s , t ) when s and t are fixed and r is sufficiently large.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Igor Araujo (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: