Timeline for How many simple cycles can a graph with $n$ vertices and $m$ edges have?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 4, 2015 at 18:34 | comment | added | user83660 | I know what the domain and the range is but it is so had some time but I can get it done.(((: | |
| Apr 17, 2015 at 5:58 | comment | added | domotorp | @Brendan: To be honest, I did not spend too much time thinking about this, it was just obvious that the end becomes exponential. I am more interested in the beginning, like the function in Tony's answer, except that I want the minimum number of cycles. | |
| Apr 17, 2015 at 1:00 | answer | added | Tony Huynh | timeline score: 5 | |
| Apr 17, 2015 at 0:56 | comment | added | Brendan McKay | If the rate of growth accelerates as more edges are added, it can't literally become exponential until we are only $O(n\log n)$ edges short of a complete graph. Is that inconsistent with what you know? | |
| Apr 16, 2015 at 20:20 | history | edited | domotorp | CC BY-SA 3.0 |
added 3 characters in body
|
| Apr 16, 2015 at 20:11 | answer | added | Igor Rivin | timeline score: 2 | |
| Apr 16, 2015 at 20:02 | history | asked | domotorp | CC BY-SA 3.0 |