Timeline for Expected number of independent sets of size $k$ in random graph $G(n,p)$
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 24, 2017 at 21:00 | answer | added | Gwen McKinley | timeline score: 2 | |
| Feb 27, 2016 at 16:16 | vote | accept | fiftyeight | ||
| Jan 26, 2016 at 4:04 | history | tweeted | twitter.com/StackCompSci/status/691834106544521216 | ||
| Jan 25, 2016 at 16:54 | answer | added | Yuval Filmus | timeline score: 7 | |
| Jan 25, 2016 at 16:44 | comment | added | Denis Pankratov | Most likely you won't find derivation of this formula in a research article, because it is a simple exercise in basic probability theory. I suggest you learn linearity of expectation and indicator random variables, then derive the formula yourself. | |
| Jan 25, 2016 at 14:37 | history | asked | fiftyeight | CC BY-SA 3.0 |