Timeline for Turan's theorem for connected graphs?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 9, 2014 at 17:27 | history | edited | Tony Huynh | CC BY-SA 3.0 |
deleted 238 characters in body
|
| Jun 9, 2014 at 16:52 | comment | added | Gorka | Oh, I see, then I agree. | |
| Jun 9, 2014 at 16:42 | comment | added | Tony Huynh | I re-indexed so that I am excluding an independent set of size $k+1$. So for me, I add $k-1$ edges. | |
| Jun 9, 2014 at 16:14 | comment | added | Gorka | we are adding k-2 right? because there are k-1 components, and we only need k-2 edges to connect them. | |
| Jun 9, 2014 at 14:33 | history | edited | Tony Huynh | CC BY-SA 3.0 |
fixed indexing for Turan's theorem
|
| Jun 9, 2014 at 4:46 | history | answered | Tony Huynh | CC BY-SA 3.0 |