Name
Abstract | ||
|---|---|---|
The smallest n such that every colouring of the edges of K n must contain a monochromatic star K 1,s+1 or a properly edge-coloured K t is denoted by f (s, t). Its existence is guaranteed by the Erdős–Rado Canonical Ramsey theorem and its value for large t was discussed by Alon, Jiang, Miller and Pritikin (Random Struct. Algorithms 23:409–433, 2003). In this note we primarily consider small values of t. We give the exact value of f (s, 3) for all s ≥ 1 and the exact value of f (2, 4), as well as reducing the known upper bounds for f (s, 4) and f (s, t) in general. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/s00373-010-0970-5 | Graphs and Combinatorics |
Keywords | Field | DocType |
edge-coloured k,edge-coloured subgraphs,monochromatic star k,bounded degree,rado canonical ramsey theorem,small value,properly edge-coloured · rainbow · canonical ramsey theorem,upper bound,exact value,random struct,k n,graphs,discrete mathematics,natural sciences | Ramsey theory,Graph,Discrete mathematics,Monochromatic color,Combinatorics,struct,Ramsey's theorem,Rainbow,Mathematics,Bounded function | Journal |
Volume | Issue | ISSN |
27 | 2 | 1435-5914 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Klas Markström | 1 | 162 | 25.84 |
| Andrew Thomason | 2 | 71 | 16.01 |
| Peter Wagner | 3 | 6 | 0.89 |