A new lower bound for a Ramsey-type problem (Q2568501)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2213262
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new lower bound for a Ramsey-type problem |
scientific article; zbMATH DE number 2213262 |
Statements
A new lower bound for a Ramsey-type problem (English)
0 references
27 June 2006
0 references
Let \(3 \leq r < s\) be fixed integers. Let \(G\) be a \(K_s\)-free graph on \(n\) vertices and denote \(f_r(G)\) the maximum cardinality of a subset of \(V(G)\) that contains no copy of \(K_r.\) Furthermore let \(f_{r,s}=\min f_r(G)\) where the minimum is taken on all \(K_s\)-free graphs on \(n\) vertices. This nice short paper draws new lower bounds on this quantity, improving substantially previously known results.
0 references
Ramsey theory
0 references
0.8314068913459778
0 references
0.8079350590705872
0 references
0.8078926205635071
0 references
0.8072350025177002
0 references
0.7876704931259155
0 references
