Ramsey-Turán problems with small independence numbers

DOI10.1016/J.EJC.2023.103872arXiv2207.10545MaRDI QIDQ6201873FDOQ6201873

Authors: József Balogh, Ce Chen, Grace McCourt, Cassie Murley 

Publication date: 26 March 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: Given a graph $H$ and a function $f(n)$, the Ramsey-Tur'an number $RT(n,H,f(n))$ is the maximum number of edges in an $n$-vertex $H$-free graph with independence number at most $f(n)$. For $H$ being a small clique, many results about $RT(n,H,f(n))$ are known and we focus our attention on $H=K_s$ for $sleq13$. By applying Szemer'edi's Regularity Lemma, the dependent random choice method and some weighted Tur'an-type results, we prove that these cliques have the so-called phase transitions when $f(n)$ is around the inverse function of the off-diagonal Ramsey number of $K_r$ versus a large clique $K_n$ for some $rleqs$.

Full work available at URL: https://arxiv.org/abs/2207.10545

zbMATH Keywords

dependent random choice methodSzemerédi's regularity lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Ramsey theory (05D10)

Cites Work

• Title not available (Why is that?)
• A note on the independence number of triangle-free graphs
• A note on Ramsey numbers
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• The early evolution of the \(H\)-free process
• On a Ramsey-Turán type problem
• A few remarks on Ramsey--Turán-type problems
• Phase transitions in Ramsey-Turán theory
• Turán-Ramsey Theorems and K_p-Independence Numbers
• Title not available (Why is that?)
• Title not available (Why is that?)
• More results on Ramsey-Turán type problems
• Two Conjectures in Ramsey--Turán Theory
• Title not available (Why is that?)
• Localized versions of extremal problems
• The Ramsey-Turán problem for cliques
• Dynamic concentration of the triangle‐free process
• The asymptotics of \(r(4,t)\)

Cited In (3)

• A localized approach to generalized Turán problems
• Localized version of hypergraph Erdős-Gallai theorem
• A localized approach for Turán number of long cycles

This page was built for publication: Ramsey-Turán problems with small independence numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201873)