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.
Citation
Xuezhi Zhao. "A new lower bound for the number of roots of maps between graphs." Topol. Methods Nonlinear Anal. 33 (1) 17 - 29, 2009.
Information
Published: 2009
First available in Project Euclid: 27 April 2016
zbMATH: 1201.37062
MathSciNet: MR2512951
Rights: Copyright © 2009 Juliusz P. Schauder Centre for Nonlinear Studies
