Two Conjectures in Ramsey--Turán Theory
From MaRDI portal
Publication:4631418
DOI10.1137/18M1186708zbMath1407.05235arXiv1803.04721OpenAlexW2964315975WikidataQ122950300 ScholiaQ122950300MaRDI QIDQ4631418
Younjin Kim, Hong Liu, Jae-Hoon Kim
Publication date: 29 March 2019
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.04721
Related Items (4)
Clique-factors in graphs with sublinear -independence number ⋮ Ramsey-Turán problems with small independence numbers ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Two results on Ramsey-Turán theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
- On the Ramsey number of the triangle and the cube
- The critical window for the classical Ramsey-Turán problem
- More results on Ramsey-Turán type problems
- Triangle-free graphs whose independence number equals the degree
- A note on the independence number of triangle-free graphs
- On a Ramsey-Turán type problem
- A few remarks on Ramsey--Turán-type problems
- Edges not in any monochromatic copy of a fixed graph
- Phase transitions in Ramsey-Turán theory
- Turán-Ramsey theorems and simple asymptotically extremal structures
- The Ramsey-Turán problem for cliques
- Triangle factors of graphs without large independent sets and of weighted graphs
- Dependent random choice
- Triangle-Tilings in Graphs Without Large Independent Sets
- On the average size of independent sets in triangle-free graphs
- The Ramsey number R(3, t) has order of magnitude t2/log t
- On Two Problems in Ramsey--Turán Theory
- Dynamic concentration of the triangle-free process
- Ramsey-Turán theory
- On the number of edge-disjoint triangles in \(K_4\)-free graphs
This page was built for publication: Two Conjectures in Ramsey--Turán Theory
