Name
Abstract | ||
|---|---|---|
We prove a 1985 conjecture of Gyárfás that for all k, ℓ, every graph with sufficiently large chromatic number contains either a clique of cardinality more than k or an induced cycle of length more than ℓ. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s00493-016-3467-x | Combinatorica |
Keywords | Field | DocType |
05C15, 05C17 | Discrete mathematics,Graph,Combinatorics,Chromatic scale,Vertex (geometry),Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
37 | 6 | 0209-9683 |
Citations | PageRank | References |
6 | 0.99 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maria Chudnovsky | 1 | 390 | 46.13 |
| Alex Scott | 2 | 251 | 40.93 |
| Paul D. Seymour | 3 | 2786 | 314.49 |