Timeline for Do graphs with $\omega(G) = \chi(G)$ grow "common" as $|V|$ grows large?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 23, 2015 at 11:40 | answer | added | David Roberson | timeline score: 3 | |
| Nov 20, 2015 at 19:39 | vote | accept | Dominic van der Zypen | ||
| Nov 20, 2015 at 16:51 | review | Close votes | |||
| Nov 20, 2015 at 20:33 | |||||
| Nov 20, 2015 at 16:25 | answer | added | Ilya Bogdanov | timeline score: 6 | |
| Nov 20, 2015 at 15:33 | comment | added | Dominic van der Zypen | That's right, I intended ${\cal P}_2([n])$ to be the set of (unordered) pair sets from $[n]$. What's the standard notation? And thanks for your argument -> could you post it as an answer? | |
| Nov 20, 2015 at 15:10 | comment | added | Ben Barber | Is your notation slightly off? It looks like $\mathcal P_2([n])$ is just the set of pairs from $[n]$. In any case, a random graph has clique number $\log n$ and chromatic number $n/\log n$ (up to constants) with high probability, so $q_n \to 0$. | |
| Nov 20, 2015 at 14:57 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |