论文标题
年轻的路径枚举-fibonacci图
Enumeration of paths in Young--Fibonacci graph
论文作者
论文摘要
年轻的-fibonacci图是两者之一（以及年轻的晶格）之一的Hasse图。这解释了此图中的路径枚举问题的兴趣。我们获得了一个幼年图的两个顶点之间的路径数量的公式，该路径相对于其最低等级是多项式的。
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.
