Timeline for How many triangles can a connected graph with $n$ vertices and $m$ edges have?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 16, 2017 at 2:58 | comment | added | orezvani | This can be further improved with $\Delta_G \leq m^{3/2}$. | |
| Jun 27, 2015 at 8:07 | comment | added | Xueyi Huang | Thanks, this method is very helpful. This bound can be easily improved as $\Delta_G\leq\frac{n-1}{6}(2m-n+1)^{\frac{3}{2}}$. | |
| Jun 27, 2015 at 8:02 | vote | accept | Xueyi Huang | ||
| Jun 27, 2015 at 7:58 | vote | accept | Xueyi Huang | ||
| Jun 27, 2015 at 8:02 | |||||
| Jun 26, 2015 at 11:33 | history | answered | Shahrooz | CC BY-SA 3.0 |