2019
DOI: 10.1007/s11856-019-1831-4
|View full text |Cite
|
Sign up to set email alerts
|

The Ramsey–Turán problem for cliques

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 18 publications
(16 citation statements)
references
References 8 publications
0
16
0
Order By: Relevance
“…Capturing this more subtle behaviour, Fox, Loh and Zhao [13] proved that ̺(K 4 , δ) = 1 8 + Θ(δ). Building on Fox-Loh-Zhao's work, Lüders and Reiher [20] have very recently showed that, surprisingly, there is a precise Date: July 26, 2018. J.K. was supported by ERC grant 306349; Y.K.…”
Section: Introduction and Resultsmentioning
confidence: 99%
“…Capturing this more subtle behaviour, Fox, Loh and Zhao [13] proved that ̺(K 4 , δ) = 1 8 + Θ(δ). Building on Fox-Loh-Zhao's work, Lüders and Reiher [20] have very recently showed that, surprisingly, there is a precise Date: July 26, 2018. J.K. was supported by ERC grant 306349; Y.K.…”
Section: Introduction and Resultsmentioning
confidence: 99%
“…Thus Theorem 9 shows that C 2m+1 has a phase transition from n to o(n). Let us point out that RT(n, {C 3 , C 5 , C 7 }, s) s 2 appeared in [18] (Lemma 7.1).…”
Section: Denote By Kmentioning
confidence: 99%
“…It was motivated by the classical theorems of Ramsey and Turán and their connections to geometry, analysis, and number theory. Ramsey-Turán theory has attracted a great deal of attention over the last 40 years, see, e.g, [3,4,6,7,8,11,12,15,18,22,23], and a survey by Simonovits and Sós [20].…”
Section: Introductionmentioning
confidence: 99%
“…[7,19]) and due to its applicability to other parts of extremal combinatorics, such as Turán's hypergraph problem and the Ramsey-Turán theory of graphs (see e.g. [5,13,14]).…”
Section: Fact 24 Let H Be a Hypergraph On 8 Vertices Not Containingmentioning
confidence: 99%