On generalized Ramsey numbers of Erdős and Rogers

DOI10.1016/j.jctb.2014.06.006zbMath1301.05225arXiv1309.4521MaRDI QIDQ462933

Troy Retter, Vojtěch Rödl, Andrzej Dudek

Publication date: 22 October 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

generalized Ramsey numbersErdős and Rogers numbers

Mathematics Subject Classification ID

05C55: Generalized Ramsey theory

Related Items

On the Stability of the Graph Independence Number, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Quasiplanar graphs, string graphs, and the Erdős-Gallai problem, On vertex Ramsey graphs with forbidden subgraphs, A note on pseudorandom Ramsey graphs, The asymptotics of \(r(4,t)\), On the minimum degree of minimal Ramsey graphs for multiple colours, On the Ramsey-Turán number with small \(s\)-independence number, Two problems in graph Ramsey theory, A note on upper bounds for some generalized Folkman numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
• Graphs without large triangle free subgraphs
• Constructive bounds for a Ramsey-type problem
• \(K_4\)-free graphs without large induced triangle-free subgraphs
• A new lower bound for a Ramsey-type problem
• On the Function of Erdős and Rogers
• K^s-Free Graphs Without Large K^r-Free Subgraphs
• Large K_r‐free subgraphs in K_s‐free graphs and some other Ramsey‐type problems
• Bounding Ramsey numbers through large deviation inequalities
• On the independence number of sparse graphs
• On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs
• The Construction of Certain Graphs