A new lower bound for the number of roots of maps between graphs

Xuezhi Zhao

DOI: http://dx.doi.org/10.12775/TMNA.2009.002

Abstract


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.

Keywords


Root of map; graph; homotopy

Full Text:

FULL TEXT

Refbacks

  • There are currently no refbacks.

Partnerzy platformy czasopism