Timeline for Acyclic orientations of complete graphs in terms of Stirling numbers?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 25, 2022 at 13:38 | answer | added | Damn it My Foot | timeline score: 0 | |
| Dec 4, 2018 at 0:25 | answer | added | Angelo Lucia | timeline score: 2 | |
| Jun 25, 2012 at 23:09 | comment | added | Richard Stanley | More interesting is the generalization to any graph, due to Greene and Zaslavsky. See Corollary 7.4 of their paper at vulcan.math.binghamton.edu/zaslav/Tpapers/iwn.tams1983.pdf. | |
| Jun 25, 2012 at 18:06 | answer | added | Adam | timeline score: 4 | |
| Jun 25, 2012 at 16:49 | comment | added | Benjamin Steinberg | An acyclic ordering on a complete graph is just the same think as a total order on the vertices. Edges point from small to big. There are clearly n! of these. So it seems you just want to interpret your identity in terms of linear orders. | |
| Jun 25, 2012 at 15:38 | history | asked | Adam | CC BY-SA 3.0 |