1 paper
Veselin Blagoev
Building on previous work by Cameron et al. in [3], we give a recurrence for computing the number of acyclic orientations of complete k-partite graphs, which can be implemented t…