3
votes
1answer
390 views

Acyclic orientations of complete graphs in terms of Stirling numbers?

It is well-known that the number of acyclic orientations of $K_n$ is $n!$. Does anybody know of a combinatorial argument for this fact which uses the identity: $$n!=\sum_{k=1}^ns(n,k),$$ where the ...