Timeline for Turan's theorem for connected graphs?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 9, 2021 at 23:03 | vote | accept | Gorka | ||
| Jul 11, 2014 at 12:59 | answer | added | George Shakan | timeline score: 1 | |
| Jun 9, 2014 at 17:09 | answer | added | Flo Pfender | timeline score: 3 | |
| Jun 9, 2014 at 4:46 | answer | added | Tony Huynh | timeline score: 1 | |
| Jun 7, 2014 at 4:18 | comment | added | Gorka | using the modification of Turan we see the optimal graph is made up of $k-1$ components, each of which is a clique. So we only need k-2 edges to connect those cliques. | |
| Jun 7, 2014 at 4:15 | comment | added | Flo Pfender | that bound looks sharp, I'd be surprised if it wasn't (at least for n large). | |
| Jun 6, 2014 at 4:43 | comment | added | Gorka | A rather good upper bound is the bound offered by Turans theorem plus $k-2$ | |
| Jun 6, 2014 at 4:40 | history | asked | Gorka | CC BY-SA 3.0 |