Searcharxiv⌕ Search

arXiv subjects

Reinhard Diestel

Publications and source records attributed to Reinhard Diestel.

42 records · Page 3Linked to original sources

Locally finite graphs with ends: a topological approach. III. Fundamental group and homology

This paper is the last part of a comprehensive survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends, assume the role played in finite graphs by paths and cycles. The first two parts of the survey together provide a suitable entry point to this field for new readers; they are available in combined form in arXiv:0912.4213. The topological approach indicated above has made it possible to extend to locally finite graphs many classical theorems of finite graph theory that do not extend verbatim. While the first part of this survey introduces the theory as such and the second part is devoted to those applications, this third part looks at the theory from an algebraic-topological point of view. The results surveyed here include both a combinatorial description of the fundamental group of a locally finite graph with ends and the homology aspects of this space.

math.AT↗

The Erdös-Pósa property for clique minors in highly connected graphs

We prove the existence of a function f: N^2 -> N such that for all p,k in N every (k(p-3) + 14p+14) - connected graph either has k disjoint K_p minors or contains a set of at most f(p,k) vertices whose deletion kills all its K_p minors. For fixed p > 4, the connectivity bound of about k(p-3) is smallest possible, up to an additive constant: if we assume less connectivity in terms of k, there will be no such function f.

math.CO↗

On the homology of locally finite graphs

We show that the topological cycle space of a locally finite graph is a canonical quotient of the first singular homology group of its Freudenthal compactification, and we characterize the graphs for which the two coincide. We construct a new singular-type homology for non-compact spaces with ends, which in dimension~1 captures precisely the topological cycle space of graphs but works in any dimension.

math.CO↗

The fundamental group of a locally finite graph with ends

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental groups of the finite subgraphs of G.

math.CO↗

Dominating functions and graphs

A graph is called dominating if its vertices can be labelled with integers in such a way that for every function f: omega-> omega the graph contains a ray whose sequence of labels eventually exceeds f. We obtain a characterization of these graphs by producing a small family of dominating graphs with the property that every dominating graph must contain some member of the family.

math.LO↗