Name
Abstract | ||
|---|---|---|
We prove a conjecture of András Gyárfás, that for all κ,ℓ, every graph with clique number at most κ and sufficiently large chromatic number has an odd hole of length at least ℓ. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.jctb.2019.05.001 | Journal of Combinatorial Theory, Series B |
DocType | Volume | ISSN |
Journal | 140 | 0095-8956 |
Citations | PageRank | References |
2 | 0.85 | 1 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maria Chudnovsky | 1 | 390 | 46.13 |
| Alex Scott | 2 | 251 | 40.93 |
| Paul D. Seymour | 3 | 2786 | 314.49 |
| Sophie Theresa Spirkl | 4 | 8 | 7.36 |