Timeline for Drunken X-mas polynomials for graphs
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 13 at 15:52 | vote | accept | Roland Bacher | ||
| Sep 4 at 23:57 | answer | added | Abdelmalek Abdesselam | timeline score: 2 | |
| Sep 4 at 16:30 | comment | added | Will Sawin | The derivative at $x=1$ over $N!$ will be $N$ times the average distance between two randomly selected vertices of the graph, since each vertex is sent to a randomly selected vertex. This explains your $(N^2-1)/3$ formula. | |
| Sep 4 at 14:14 | history | edited | Roland Bacher | CC BY-SA 4.0 |
added 27 characters in body
|
| Sep 4 at 13:59 | history | asked | Roland Bacher | CC BY-SA 4.0 |