Timeline for How many triangles can a connected graph with $n$ vertices and $m$ edges have?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 15, 2016 at 14:37 | answer | added | Igor Rivin | timeline score: 3 | |
| 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 | answer | added | Shahrooz | timeline score: 7 | |
| Jun 22, 2015 at 11:10 | comment | added | Xueyi Huang | @Soltész I want to get a good bound in terms of $m-n+1$. I believe this number could be bounded by $(m-n+1)^2$ roughly. | |
| Jun 22, 2015 at 10:55 | comment | added | Daniel Soltész | If we omit the restriction of connectedness, see this question: math.stackexchange.com/questions/823481/… Also note that we can achieve connectedness with a few number of edges, so the order of magnitude of the number of triangles is the same without your restriction. | |
| Jun 22, 2015 at 10:45 | review | First posts | |||
| Jun 22, 2015 at 10:56 | |||||
| Jun 22, 2015 at 10:42 | history | asked | Xueyi Huang | CC BY-SA 3.0 |