  The Young--Fibonacci graph is the Hasse diagram of one of the two (along with
the Young lattice) 1-differential graded modular lattices. This explains the
interest to path enumeration problems in this graph. We obtain a formula for
the number of paths between two vertices of the Young--Fibonacci graph which is
polynomial with respect to the minimum of their ranks.
