scientific article; zbMATH DE number 2052616
A (metric) continuum is said to be hereditarily unicoherent if the intersection of every two of its subcontinua is connected. A dendroid means an arcwise connected and hereditarily unicoherent continuum. A digraph \(D = (V(D), A(D))\) is a pair formed by a set \(V(D)\) and an irreflexive relation \(A(D)\) on \(V(D)\). The elements of \(V(D)\) and \(A(D)\) are called the vertices and arrows of \(D\), respectively. Let \(X\) be a dendroid and \(p \in X\). To each pair \((X,p)\) a digraph \(\Delta(X,p)\) is associated whose vertices are the arc components of \(X \setminus \{p\}\) and whose arrows are the ordered pairs \((\alpha, \beta)\) of arc components of \(X \setminus \{p\}\) such that the closure of \(\alpha\) has nonempty intersection with \(\beta\). It is proved that for any finite digraph \(D\) there is an infinite family of pairs \((X,p)\) such that \(\Delta(X,p)\) is isomorphic to \(D\). Many similar results are also presented. For the entire collection see [Zbl 1005.00053].
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4454260)