Coloring arcs of convex sets (Q1567612)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Coloring arcs of convex sets |
scientific article; zbMATH DE number 1462277
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coloring arcs of convex sets |
scientific article; zbMATH DE number 1462277 |
Statements
Coloring arcs of convex sets (English)
0 references
29 January 2001
0 references
The Ramsey number \(r(H,K_m)\) is the smallest integer \(n\) so that each graph on \(n\) vertices that fails to contain \(H\) as a subgraph has independence number at least \(m\). The authors prove several results including Theorem 5: For all \(m\geq 2\), \[ r(C_5, K_m)\leq {2(3m)^{3/2}\over \sqrt{\log m}}. \]
0 references
Ramsey number
0 references
independence number
0 references
