On the Ramsey-Turán numbers of graphs and hypergraphs
From MaRDI portal
Publication:1955731
DOI10.1007/s11856-012-0076-2zbMath1266.05084arXiv1109.4428MaRDI QIDQ1955731
Publication date: 18 June 2013
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.4428
Related Items
On Two Problems in Ramsey--Turán Theory, Embedding clique-factors in graphs with low \(\ell\)-independence number, Clique-factors in graphs with sublinear -independence number, A Ramsey–Turán theory for tilings in graphs, On the Ramsey-Turán number with small \(s\)-independence number, The critical window for the classical Ramsey-Turán problem, Phase transitions in Ramsey-Turán theory, Hypergraphs with zero chromatic threshold, Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Cites Work
- More results on Ramsey-Turán type problems
- An extension of the isoperimetric inequality on the sphere
- Note on a Ramsey-Turán type problem
- On a Ramsey-Turán type problem
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- A few remarks on Ramsey--Turán-type problems
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- A hypergraph extension of Turán's theorem
- On graphs with small Ramsey numbers*
- Dependent random choice
- On sets of integers containing k elements in arithmetic progression
- Turán-Ramsey Theorems and Kp-Independence Numbers
- The Construction of Certain Graphs
- On the structure of linear graphs
- Ramsey numbers of sparse hypergraphs
- Ramsey-Turán theory