1 paper · 1 filter
Piotr M. Hajac, Elizabeth A. Pacheco, Åukasz Kaczmarczyk +1
We consider the class of acyclic connected directed graphs with N≥1. In this paper we find the optimal upper bound for the number of paths amongst acyclic, connected graphs w…