Name
Abstract | ||
|---|---|---|
For graphs G and H we write G → ind H if every 2-edge colouring of G yields an induced monochromatic copy of H . The induced Ramsey number for H is defined as r ind ( H )=min{| V ( G )|: G → ind H }. We show that for every d ⩾1 there exists an absolute constant c d such that r ind ( H n, d )⩽ n c d for every graph H n, d with n vertices and the maximum degree at most d . This confirms a conjecture suggested by W. T. Trotter. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1006/jctb.1996.0025 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
induced ramsey number,bounded maximum degree,ramsey number,maximum degree | Discrete mathematics,Graph,Monochromatic color,Combinatorics,Ramsey's theorem,Degree (graph theory),Conjecture,Mathematics,Bounded function | Journal |
Volume | Issue | ISSN |
66 | 2 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
6 | 0.68 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomasz Łuczak | 1 | 225 | 40.26 |
| Vojtěch Rödl | 2 | 887 | 142.68 |