Timeline for Graph $G$ with $\omega(G) = 2$ but $\chi(G) \geq \aleph_0$
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 26, 2015 at 6:44 | answer | added | Włodzimierz Holsztyński | timeline score: 2 | |
| May 20, 2015 at 13:02 | vote | accept | Dominic van der Zypen | ||
| May 20, 2015 at 12:53 | comment | added | Ashutosh | Yes, See this: renyi.hu/~p_erdos/1959-19.pdf | |
| May 20, 2015 at 12:47 | answer | added | Chris Lambie-Hanson | timeline score: 17 | |
| May 20, 2015 at 10:19 | comment | added | Damian Sobota | For $\chi(G)=\aleph_0$ you can just take an infinite disjoint union of graphs $G_n$ such that $\chi(G_n)=n$ and $\omega(G_n)=2$. | |
| May 20, 2015 at 9:34 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |