Classes of locally finite ubiquitous graphs

  • Authors:

  • Thomas Andreae

  • Affiliations:

  • Mathematisches Seminar, Universität Hamburg, Bundesstraíe 55, 20146 Hamburg, Germany

  • Venue:
  • Journal of Combinatorial Theory Series B
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

A classical result of Halin states that if a graph G contains n disjoint rays for every n@?N, then G contains infinitely many disjoint rays. The question how this generalizes to graphs other than rays leads to the notion of ubiquity: a graph A is ubiquitous with respect to a relation =