The hyperspace of connected boundary subcontinua of a continuum (Q2222104)

For a metric continuum \(X\), \(C(X)\) denotes the hyperspace of subcontinua of \(X\) and \(F_{1}(X)=\{\{p\}\in C(X):p\in X\}\). In this paper the authors study the following hyperspaces: \(CB(X)=\{A\in C(X):bd(A)\) is connected\(\}\) and \(M(X)=\{A\in C(X):bd(A)=A\}\). Among other results, they prove the following, for a continuum \(X\). (A) If \(CB(X)=C(X)\), then \(X\) contains an indecomposable continuum. (B) If \(X\) is a local dendrite such that \(CB(X)\setminus \{X\}=F_{1}(X)\), then \(X\) is a finite graph. (C) If \(X\) is a finite graph, then \(CB(X)\setminus \{X\}=F_{1}(X)\) if and only if \(X\) is cyclicly connected (that is, every pair of points of \(X\) is contained in a simple closed curve in \(X\)). (D) For a continuum \(X\) the following are equivalent: (1) \(X\) is an arc, (2) \(CB(X)\) is a simple closed curve, and (3) \(CB(X)\) is a one-dimensional continuum containing no simple triods. (E) For a continuum \(X\) the following are equivalent: (1) \(X\) is a simple closed curve, (2) \(CB(X)\setminus \{X\}\) is a simple closed curve, and (3) \(CB(X)\setminus \{X\}\) is a one-dimensional continuum containing no simple triod. (F) There exists an explicit formula for computing the number of components of \(CB(X)\) for finite graphs.