Coincidence of maps from two-complexes into graphs
Keywords
Coincidence theory, two-complex, graphsAbstract
The main theorem of this article provides a necessary and sufficient condition for a pair of maps from a two-complex into a one-complex (a graph) can be homotoped to be coincidence free. As a consequence of it, we prove that a pair of maps from a two-complex into the circle can be homotoped to be coincidence free if and only if the two maps are homotopic. We also obtain an alternative proof for the known result that every pair of maps from a graph into the bouquet of a circle and an interval can be homotoped to be coincidence free. As applications of the main theorem, we characterize completely when a pair of maps from the bi-dimensional torus into the bouquet of a circle and an interval can be homotoped to be coincidence free, and we prove that every pair of maps from the Klein bottle into such a bouquet can be homotoped to be coincidence free.Downloads
Published
2013-04-22
How to Cite
1.
FENILLE, Marcio Colombo. Coincidence of maps from two-complexes into graphs. Topological Methods in Nonlinear Analysis. Online. 22 April 2013. Vol. 42, no. 1, pp. 193 - 206. [Accessed 7 November 2024].
Issue
Section
Articles
Stats
Number of views and downloads: 0
Number of citations: 0