Timeline for Extremal problem: #paths of length l as function of number of edges
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 15, 2016 at 5:22 | answer | added | Douglas Zare | timeline score: 3 | |
| Jan 15, 2016 at 5:01 | comment | added | Douglas Zare | It seems more reasonable if you say "at least" instead of "at most" since the Perron-Frobenius eigenvectors tend to have a higher weight on high degree vertices. | |
| Jan 15, 2016 at 1:23 | comment | added | Brendan McKay | Your paths are simple? | |
| Jan 14, 2016 at 19:01 | comment | added | Emil Jeřábek | It fails for stars. | |
| Jan 14, 2016 at 18:34 | history | asked | David Harris | CC BY-SA 3.0 |