2015
DOI: 10.1016/j.topol.2015.04.010
|View full text |Cite
|
Sign up to set email alerts
|

Arcwise increasing maps

Abstract: A surjective continuous map f : [0, 1] → X is called an arcwise increasing map if for any two closed subintervalsA continuum X is said to admit an arcwise increasing map if there is an arcwise increasing map onto X. It is shown that any Peano continuum with no free arcs admits an arcwise increasing map, and a characterization of graphs and dendrites that admit arcwise increasing maps is given.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

2
1
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 3 publications
2
1
0
Order By: Relevance
“…We prove that for each n ≥ 1 the set of all surjective continuumwise injective maps from an n-dimensional continuum onto an LC n−1 -continuum with the disjoint (n−1, n)-cells property is a dense G δ -subset of the space of all surjective maps. This generalizes a result of Espinoza and the second author [5]. …”
supporting
confidence: 90%
“…We prove that for each n ≥ 1 the set of all surjective continuumwise injective maps from an n-dimensional continuum onto an LC n−1 -continuum with the disjoint (n−1, n)-cells property is a dense G δ -subset of the space of all surjective maps. This generalizes a result of Espinoza and the second author [5]. …”
supporting
confidence: 90%
“…Harrold, in [31], showed that every Peano continuum without free arcs is the strongly irreducible (equivalently, almost injective) image of the circle, and so is Eulerian. We extend this resultand also one of Espinoza & Matsuhashi, see [26] -so as to give more control of the map.…”
Section: 32supporting
confidence: 57%
“…As the results are important for us, and for completeness, we provide brief proofs. For discussions on hereditarily irreducible and arc-wise increasing images of finite graphs see [1,26].…”
Section: Equivalent Definitions For Eulerian Mapsmentioning
confidence: 99%