Timeline for Inequality involving size of nodes & min degree of graph
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 8, 2011 at 5:32 | comment | added | Tony Huynh | It looks like they prove something slightly stronger in fact. Namely $|V'| \geq 2^d$' where $d$ is the average degree of $G$. | |
| Oct 7, 2011 at 15:19 | history | answered | Ryan O'Donnell | CC BY-SA 3.0 |