Name
Abstract | ||
|---|---|---|
Hajós conjectured that everys-chromatic graph contains a subdivision ofK
s, the complete graph ons vertices. Catlin disproved this conjecture. We prove that almost all graphs are counter-examles in a very strong sense. |
Year | DOI | Venue |
|---|---|---|
1981 | 10.1007/BF02579269 | Combinatorica |
Keywords | Field | DocType |
complete graph | Discrete mathematics,Complete graph,Combinatorics,Vertex (geometry),Coxeter graph,Subdivision,Graph minor,Universal graph,Moser spindle,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
1 | 2 | 1439-6912 |
Citations | PageRank | References |
32 | 12.36 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul Erdös | 1 | 191 | 42.33 |
| Siemion Fajtlowicz | 2 | 93 | 26.12 |