Infinite graphs and planar maps

Abstract

Listen

Translate article

Topological properties of infinite graphs may be global or local. The number of ends (equivalence classes of rays that cannot be separated by a finite subgraph) and whether a given end contains an infinite set of pairwise disjoint rays describe an infinite graph globally. Automorphisms are of interest in terms of both the cardinalities of their set of orbits as well as the cardinalities of the orbits themselves. The notion of connectivity is refined to consider whether the deletion of a subgraph leaves finite or infinite components. The rate of growth, whether polynomial or exponential, tells much about the graph's global structure. Embedding of infinite graphs is of interest primarily in non-compact surfaces such as the plane, but even in the plane, issues arise concerning accumulation points. The interaction of these considerations is brought to bear on the structure of infinite planar graphs and maps . Introduction An infinite graph is locally finite if every vertex has finite degree. (Local finiteness does not imply that the set of degrees is bounded.) Generally, but not always, the graphs in this chapter are locally finite. A myopic graph theorist, standing at any vertex of an infinite but locally finite graph, views a landscape that resembles a finite graph of very large diameter. Thus, many of the ‘local’ properties of locally finite graphs coincide with analogous properties of finite graphs; the theories diverge only when one looks at infinite graphs ‘globally’.