Timeline for The max-clique chromatic number of a graph
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 3 at 3:56 | history | edited | Fedor Petrov | CC BY-SA 4.0 |
added 126 characters in body
|
| Dec 3 at 3:18 | comment | added | bof | Well, the OP cites Zorn's lemma for the existence of maximal cliques, which must be overkill if only finite graphs are intended! | |
| Dec 2 at 18:46 | comment | added | Fedor Petrov | @bof sorry, I always read "graph" as a "finite graph". Interesting question, not clear immediatly | |
| Dec 2 at 17:14 | comment | added | bof | That works if the chromatic number is finite. Does the question make sense if the chromatic number can be an infinite cardinal number? | |
| Dec 2 at 15:27 | vote | accept | Dominic van der Zypen | ||
| Dec 3 at 8:41 | |||||
| Dec 2 at 15:03 | review | Low quality posts | |||
| Dec 2 at 15:18 | |||||
| Dec 2 at 14:42 | history | answered | Fedor Petrov | CC BY-SA 4.0 |