Timeline for Tight bound of Turan number for K_{1,t,t}
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 7, 2016 at 21:26 | comment | added | user36212 | I forgot the exact reference, I'm afraid - I just remember it being impossible to find outside Oberwolfach library. As a next best, combinatorics.org/ojs/index.php/eljc/article/view/v17i1r21 does the same for the Andrasfai-Erdos-Sos theorem. You can easily get Simonovits' theorem from this by deleting low-degree vertices until it applies. But the method here isn't good for getting precise answers like K_{1,t,t}. | |
| Aug 5, 2016 at 22:09 | comment | added | Louis D | Thanks for pointing this out! I've always wondered if determining the exact value for all bipartite graphs would give the exact result for all graphs, and I certainly wasn't aware of this result (any more info on where I could find it?). I often hear things like "Erdos-Stone gives us the correct asymptotics for non-bipartite graphs," but I think it would be better to say something like "Erdos-Stone gives the correct asymptotics for all graphs, but says nothing about the lower order terms for any graph. It just so happens that for bipartite graphs the lower order terms are all there is." | |
| Aug 5, 2016 at 18:59 | history | answered | user36212 | CC BY-SA 3.0 |