Timeline for Proof of the clique-number for random graphs: How to bound this binomial-like expression?
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 13, 2011 at 23:03 | vote | accept | Marcusm | ||
| Mar 11, 2011 at 23:24 | answer | added | Thomas Kalinowski | timeline score: 1 | |
| Mar 11, 2011 at 17:57 | comment | added | Gerhard Paseman | Assume n is large and fixed, and also fix r, possibly needing 3r < n. Then see how the quantity varies with l. Gerhard "Ask Me About System Design" Paseman, 2011.03.11 | |
| Mar 11, 2011 at 17:31 | history | asked | Marcusm | CC BY-SA 2.5 |