Twins of rayless graphs

Link:
Autor/in:
Erscheinungsjahr:
2011
Medientyp:
Text
Schlagworte:
  • Infinite
  • Matroid
  • Infinite graphs
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
  • Graph homomorphism
  • Rayless graphs
  • Embedding
  • Infinite
  • Matroid
  • Infinite graphs
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
Beschreibung:
  • Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either infinitely many twins or none.
Lizenz:
  • info:eu-repo/semantics/restrictedAccess
Quellsystem:
Forschungsinformationssystem der UHH
Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/1bdd082e-757a-43df-a93d-49bd918347bd