Timeline for Chromatic number of induced subgraphs as upper bound to the chromatic number
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 24, 2014 at 17:04 | history | edited | Louis Esperet | CC BY-SA 3.0 |
added 51 characters in body
|
| Jan 24, 2014 at 17:03 | comment | added | Louis Esperet | You're of course right, my bad. You have to consider graphs of bounded clique number. I edited the post | |
| Jan 22, 2014 at 9:42 | review | Late answers | |||
| Jan 22, 2014 at 9:44 | |||||
| Jan 22, 2014 at 9:34 | comment | added | Daniel Soltész | Maybe i misunderstood something, but isn't the complete graph on $n$ vertices a counterexample to your first question? (Every triangle-free induced subgraph has at most $2$ vertices in the complete graph.) | |
| Jan 22, 2014 at 9:24 | history | answered | Louis Esperet | CC BY-SA 3.0 |