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

DOI10.12775/TMNA.2009.002MaRDI QIDQ1029917zbMATH OpenOpenAlexFDO

Authors Xuezhi Zhao

Publication date 14 July 2009

Published in Topological Methods in Nonlinear Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.12775/tmna.2009.002

zbMATH Keywords

graphhomotopyroot of map

Mathematics Subject Classification ID

Dynamical systems involving maps of trees and graphs (37E25) Fixed points and coincidences in algebraic topology (55M20)

Review text

A lower bound for the number of roots of maps between maps in any given homotopy class is presented and shown by example to be better than some previously obtained bounds.

Recommendations

• Estimation of the number of roots on the complement
• The minimizing of the Nielsen root classes
• Minimal number of preimages under maps of surfaces
• Minimizing roots of maps into the two-sphere
• A MINIMUM THEOREM FOR THE RELATIVE ROOT NIELSEN NUMBER

Cited in

(1)

• Root problem for convenient maps

This page was built for publication: A new lower bound for the number of roots of maps between graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029917)