No label defined (Q4227946)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1247777
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1247777

      Statements

      0 references
      26 August 1999
      0 references
      graph
      0 references
      tree
      0 references
      universal map
      0 references
      light map
      0 references
      decomposition space
      0 references
      In this work, graphs are assumed to be finite and connected. A map \(f:X\rightarrow Y\) between spaces \(X\) and \(Y\) is called universal if for each map \(g:X\rightarrow Y\), there exists \(x\in X\) such that \(f(x)=g(x)\). For any graph \(G\), let \(E_G\) denote the set of endpoints of \(G\). The main result of the paper is Theorem: Let \(f:G\rightarrow T\) be a map between a graph \(G\) and a tree \(T\). If \(f\) is light and universal and \(G\smallsetminus f^{- 1}(E_T)\) contains no simple closed curve, then there exists an embedding of \(T\) into \(G\). The author uses a method which involves a so-called first order reconstitution graph of \(G\). For some background, one may consult [\textit{C. Eberhart} and \textit{J. B. Fugate}, Trans. Am. Math. Soc. 350, No. 10, 4235-4251 (1998; Zbl 0908.54026)].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references