Embedding a graph-like continuum in a surface (Q519954)

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 6699166
Language Label Description Also known as
default for all languages
No label defined
    English
    Embedding a graph-like continuum in a surface
    scientific article; zbMATH DE number 6699166

      Statements

      Embedding a graph-like continuum in a surface (English)
      0 references
      0 references
      0 references
      31 March 2017
      0 references
      A topological space \(X\) is a graph-like space if there is a 0-dimensional subspace \(V\) (these are the vertices of \(X\)) of \(X\) so that \(X\setminus V\) is the disjoint union of connected open sets (these are the edges of \(X\)), each of which is a homeomorph of the real line. In a natural way graph-like continua generalize finite graphs to infinite, compact structures. In the present paper the authors investigate embeddings of graph-like continua in compact surfaces. Generalizing results for embeddings of finite graphs they establish the following facts: (i) every edge is in an open disc that meets the graph-like continuum precisely in that edge; (ii) there are natural analogues of face boundary walks; (iii) there is a graph-like continuum triangulating the same surface and containing as a sub-graph-like continuum the original embedded graph-like continuum; (iv) the face boundaries generate a subspace of the cycle space; (v) the quotient of the cycle space by the boundary cycles is the homology of the surface.
      0 references
      graph-like continuum
      0 references
      surface
      0 references
      embedding
      0 references
      face boundary
      0 references
      cycle space
      0 references
      \({\mathbb Z}_2\)-homology
      0 references
      dual graph
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references