Timeline for Is it possible to have t triangles in some graph on n vertices?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 25, 2012 at 7:18 | history | edited | Brendan McKay | CC BY-SA 3.0 |
add numbers
|
| Sep 25, 2012 at 5:19 | vote | accept | Ben Golub | ||
| Sep 27, 2012 at 4:38 | |||||
| Sep 25, 2012 at 5:13 | comment | added | Gerhard Paseman | Oh, and I am guessing the next clique overlaps the previous one in one edge and two vertices. Gerhard "Ask Me About System Design" Paseman, 2012.09.24 | |
| Sep 25, 2012 at 5:01 | comment | added | Gerhard Paseman | It looks like Ben is happy with your answer, and indeed I am not suprised at the result. However, I suspect there are about n values to be determined (hiding in the O(n^2)), and those n values may require knowing a lot about the graphs on say log n or even sqrt(n) vertices. If I understand Terry's response correctly, his intuition says filling in the missing values will be easier than graph enumeration. Does your intuition tell you something similar to this? Gerhard "We're The Less Than 1%" Paseman, 2012.09.24 | |
| Sep 25, 2012 at 4:45 | vote | accept | Ben Golub | ||
| Sep 25, 2012 at 4:50 | |||||
| Sep 25, 2012 at 3:26 | history | answered | Brendan McKay | CC BY-SA 3.0 |