Partial confluence of maps onto graphs and inverse limits of single graphs
Centers of a dendroid
A bottleneck in a dendroid is a continuum that intersects every arc connecting two non-empty open sets. Piotr Minc proved that every dendroid contains a point, which we call a center, contained in arbitrarily small bottlenecks. We study the effect that the set of centers in a dendroid has on its structure. We find that the set of centers is arc connected, that a dendroid with only one center has uncountably many arc components in the complement of the center, and that, in this case, every open set...
No arc-connected treelike continuum is the 2-to-1 image of a continuum
In 1940, O. G. Harrold showed that no arc can be the exactly 2-to-1 continuous image of a metric continuum, and in 1947 W. H. Gottschalk showed that no dendrite is a 2-to-1 image. In 2003 we show that no arc-connected treelike continuum is the 2-to-1 image of a continuum.
Page 1