A new lower bound for the number of roots of maps between graphs
A new lower bound for the number of roots of maps between graphs
复制标题
DOI：
10.12775/tmna.2009.002
复制
发表时间：
2009-03
影响因子：
0.7
通讯作者：
Xuezhi Zhao
中科院分区：
文献类型：
--
作者：
Xuezhi Zhao
我们将提出一个新的下界图之间的映射在任何给定的同伦类的根的数目。我们还给出了一个例子，表明我们的新的下界可以任意大于本质根类的数量。
We shall present a new lower bound for the number of roots of maps between graphs in any given homotopy class. We also give an example showing that our new lower bound can be arbitrary larger than the number of essential root classes.