# upper bound on the total number of fixed-length paths in an acyclic graph [closed]

I was wondering if there is an upper bound on the total number of fixed-length paths (path length from 1 to $$n-1$$ given $$n$$ nodes) in an acyclic graph (not directed) of $$n$$ nodes? If so, can you point me to some references?

This question explains the counting $$s-t$$ path is #P-complete but I'm not sure if the same applies to my question as well.

Thanks!

• You might get some downvotes due to off-topic... – Avi Tal May 2 at 0:05
• Why this is off-topic? – xxks-kkk May 2 at 1:38
• Usually non-research level questions are off topic... The moderators will probably respond soon. – Avi Tal May 2 at 3:56
• The Computer Science forum is probably the appropriate place. I guess you are right... They should have named the TCS forum as "TCS Research"... – Avi Tal May 2 at 8:17
• As for “no obvious way”, did you read the first few sentences of cstheory.stackexchange.com/tour, or the faq cstheory.stackexchange.com/help/on-topic it refers to? They both mention research too many times for me to count. – Emil Jeřábek May 2 at 13:43