Number of paths in high-girth graphs

67 Views Asked by At

In a graph $G$ with girth $g$, say $g = \Omega(\log n)$, can we deduce an upper bound on the number of paths between two nodes $u$ and $v$?