Timeline for Tight bound of Turan number for K_{1,t,t}
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 5, 2016 at 18:59 | answer | added | user36212 | timeline score: 2 | |
| Aug 5, 2016 at 12:41 | history | edited | Myshkin | CC BY-SA 3.0 |
+ top level tag (co.) and formatting
|
| Aug 5, 2016 at 2:05 | answer | added | Louis D | timeline score: 0 | |
| Mar 24, 2016 at 8:48 | comment | added | Jon Noel | To add to Tony's comment, the Erdős–Stone Theorem gives the correct asymptotics for any non-bipartite graph. Its possible, however, that one could obtain an improvement on the lower order terms of the asymptotics for $K_{1,t,t}$. | |
| Mar 22, 2016 at 17:54 | comment | added | Tony Huynh | By the Erdős–Stone theorem, the answer is the same as that for $K_{t,t,t}$, since both graphs have chromatic number $3$. That is, the Turan number for $K_{1,t,t}$ is $(1/2 + o(1))\binom{n}{2}$. | |
| Mar 22, 2016 at 17:13 | history | asked | Connor | CC BY-SA 3.0 |