On the Ramsey-Turán number with small \(s\)-independence number
type: Item
instance of: scholarly article
title: On the Ramsey-Turán number with small \(s\)-independence number
zbMATH Open document ID: 1350.05066
author: Patrick Bennett
author: Andrzej Dudek
published in: Journal of Combinatorial Theory. Series B
publication date: 2016-11-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/1510.03950
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05B25
zbMATH DE Number: 6656186
zbMATH Keywords: finite geometries
MaRDI profile type: Publication
OpenAlex ID: W2963887825
arXiv ID: 1510.03950
cites work: Constructive bounds for a Ramsey-type problem
cites work: Q3503433
cites work: The difference between consecutive primes. II
cites work: Phase transitions in Ramsey-Turán theory
cites work: Some exact Ramsey-Turán numbers
cites work: On the Ramsey-Turán numbers of graphs and hypergraphs
cites work: Dynamic concentration of the triangle-free process
cites work: The early evolution of the \(H\)-free process
cites work: On a Ramsey-Turán type problem
cites work: Graphs without large triangle free subgraphs
cites work: Q4313087
cites work: On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs
cites work: On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
cites work: On generalized Ramsey numbers of Erdős and Rogers
cites work: Turán-Ramsey Theorems and Kp-Independence Numbers
cites work: More results on Ramsey-Turán type problems
cites work: The Construction of Certain Graphs
cites work: Q5610920
cites work: The critical window for the classical Ramsey-Turán problem
cites work: Dependent random choice
cites work: Q2716030
cites work: A new proof of Szemerédi's theorem for arithmetic progressions of length four
cites work: Q4519896
cites work: On graphs with small Ramsey numbers
cites work: Bounding Ramsey numbers through large deviation inequalities
cites work: Ks-Free Graphs Without Large Kr-Free Subgraphs
cites work: The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
cites work: A note on the independence number of triangle-free graphs
cites work: Ramsey-Turán theory
cites work: Q5666597
cites work: A few remarks on Ramsey--Turán-type problems
cites work: Large Kr‐free subgraphs in Ks‐free graphs and some other Ramsey‐type problems
cites work: A new lower bound for a Ramsey-type problem
cites work: Q4401979
cites work: Q4764145
cites work: \(K_4\)-free graphs without large induced triangle-free subgraphs
DOI: 10.1016/J.JCTB.2016.09.002
description: scientific article; zbMATH DE number 6656186