Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-07T09:35:48.001Z Has data issue: false hasContentIssue false

MULTIPLE LOOSE MAPS BETWEEN GRAPHS

Published online by Cambridge University Press:  22 April 2024

MARCIO COLOMBO FENILLE*
Affiliation:
Faculdade de Matemática, Universidade Federal de Uberlândia, Av. João Naves de Ávila, 2121, Santa Mônica, 38400-902 Uberlândia, Minas Gerais, Brazil
Rights & Permissions [Opens in a new window]

Abstract

Given maps $f_1,\ldots ,f_n:X\to Y$ between (finite and connected) graphs, with $n\geq 3$ (the case $n=2$ is well known), we say that they are loose if they can be deformed by homotopy to coincidence free maps, and totally loose if they can be deformed by homotopy to maps which are two by two coincidence free. We prove that: (i) if Y is not homeomorphic to the circle, then any maps are totally loose; (ii) otherwise, any maps are loose and they are totally loose if and only if they are homotopic.

MSC classification

Information

Type
Research Article
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of Australian Mathematical Publishing Association Inc.
Figure 0

Figure 1 A change of cellular decomposition.

Figure 1

Figure 2 The graph of the maps $f_i|_{J_0}$.

Figure 2

Figure 3 Maps with just a simple coincidence.

Figure 3

Figure 4 Deformations to annihilate coincidences.

Figure 4

Figure 5 The cube Q with three distinguished squares.

Figure 5

Figure 6 The retractions $M\setminus \Delta \to (T_x\cup T_y\cup T_y)\setminus \{p_0\}\to L$.

Figure 6

Figure 7 The graph $G=L\cup c \subset M$.

Figure 7

Table 1 The homomorphism $\ell _{\#}$.

Figure 8

Figure 8 The maps $S^1\times S^1\setminus \Delta \to L\hookrightarrow G$.