Locally connected curves admit small retractions onto graphs (Q2901927)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Locally connected curves admit small retractions onto graphs |
scientific article; zbMATH DE number 6062424
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Locally connected curves admit small retractions onto graphs |
scientific article; zbMATH DE number 6062424 |
Statements
31 July 2012
0 references
graph
0 references
locally connected curve
0 references
partition
0 references
\(\varepsilon\)-retraction
0 references
uniformly arcwise connected set
0 references
0.8526488
0 references
0.84683794
0 references
0 references
0 references
0 references
0.8295288
0 references
Locally connected curves admit small retractions onto graphs (English)
0 references
For an arbitrary \(\varepsilon >0\), an \(\varepsilon\)-mapping of a metric space \((X,d)\) onto a set \(Y\subset X\) is a continuous function \(f:X\rightarrow Y\) such that diameter\((f^{-1}(y))<\varepsilon \) for all \(y\in Y\). A curve is a one-dimensional metric continuum. An old result by \textit{S. Mazurkiewicz} [Fundam. Math. 20, 281--284 (1933; Zbl 0006.42601)] says that for every locally connected curve \(X\) and every \(\varepsilon >0\) there is an \(\varepsilon\)-mapping \(f:X\rightarrow X\) such that \(f(X)\) is a finite graph. In the paper under review, the author improves this result by proving that the mapping can be also asked to be a retraction.
0 references