# Connected but not path-connected subspaces of infinite graphs

@article{Georgakopoulos2007ConnectedBN, title={Connected but not path-connected subspaces of infinite graphs}, author={Agelos Georgakopoulos}, journal={Combinatorica}, year={2007}, volume={27}, pages={683-698} }

Solving a problem of Diestel [9] relevant to the theory of cycle spaces of infinite graphs, we show that the Freudenthal compactification of a locally finite graph can have connected subsets that are not path-connected. However we prove that connectedness and path-connectedness to coincide for all but a few sets, which have a complicated structure.

## 11 Citations

### Contractible Edges in 2-Connected Locally Finite Graphs

- MathematicsElectron. J. Comb.
- 2015

All 2-connected locally finite outerplanar graphs nonisomorphic to $K_3$ are characterized as precisely those graphs such that every vertex is incident to exactly two contractible edges as well as those graphssuch that every finite bond contains exactly twocontractible edges.

### The Line Graph of Every Locally Finite 6-Edge-Connected Graph with Finitely Many Ends is Hamiltonian

- Mathematics
- 2011

Homeomorphic images of the unit circle in the Freudenthal compactification of a graph can be seen as an infinite analogue of finite graph theoretic circles. In this sense the main result of the…

### Mathematisches Forschungsinstitut Oberwolfach Graph Theory

- Mathematics

This was a workshop on graph theory, with a comprehensive approach. Highlights included the emerging theories of sparse graph limits and of infinite matroids, new techniques for colouring graphs on…

### Graph-like continua, augmenting arcs, and Menger’s theorem

- MathematicsComb.
- 2008

It is shown that an adaptation of the augmenting path method for graphs proves Menger’s Theorem for wide classes of topological spaces, including locally compact, locally connected, metric spaces.

### Graph‐like compacta: Characterizations and Eulerian loops

- MathematicsJ. Graph Theory
- 2020

New characterizations of compact graph-like spaces are given, connecting them to certain classes of continua, and to standard subspaces of Freudenthal compactifications of locally finite graphs.

### Infinite Matroids and Determinacy of Games

- Mathematics
- 2013

Solving a problem of Diestel and Pott, we construct a large class of innite matroids. These can be used to provide counterexamples against the natural extension of the Well-quasi-ordering-Conjecture…

### Locally finite graphs with ends: A topological approach, I. Basic theory

- MathematicsDiscret. Math.
- 2011

### Locally finite graphs with ends: A topological approach, III. Fundamental group and homology

- MathematicsDiscret. Math.
- 2012

## References

SHOWING 1-10 OF 30 REFERENCES

### On end degrees and infinite cycles in locally finite graphs

- MathematicsComb.
- 2007

It is proved that the edge set of a locally finite graph G lies in C(G) if and only if every vertex and every end has even degree.

### The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits

- MathematicsJ. Comb. Theory, Ser. B
- 2004

### On Infinite Cycles II

- MathematicsComb.
- 2004

The spanning trees whose fundamental cycles generate this cycle space are characterized, and infinite analogues to the standard characterizations of finite cycle spaces in terms of edge-decomposition into single cycles and orthogonality to cuts are proved.

### On Infinite Cycles I

- MathematicsComb.
- 2004

We adapt the cycle space of a finite graph to locally
finite infinite graphs, using as infinite cycles the
homeomorphic images of the unit circle S1 in the
graph compactified by its ends. We prove…

### Martin and end compactifications for non-locally finite graphs

- Mathematics
- 1993

We consider a connected graph, having countably infinite vertex set X, which is permitted to have vertices of infinite degree. For a transient irreducible transition matrix P corresponding to a…

### Duality in Infinite Graphs

- MathematicsCombinatorics, Probability and Computing
- 2006

This work shows that obstructions fall away when duality is reinterpreted on the basis of a ‘singular’ approach to graph homology, whose cycles are defined topologically in a space formed by the graph together with its ends and can be infinite.

### The Cycle Space of an Infinite Graph

- MathematicsCombinatorics, Probability and Computing
- 2005

A new ‘singular’ approach is presented that builds the cycle space of a graph not on its finite cycles but on its topological circles, the homeomorphic images of $S^1$ in the space formed by the graph together with its ends.

### Forcing highly connected subgraphs

- MathematicsJ. Graph Theory
- 2007

Mader’s theorem does not extend to infinite graphs, not even to locally finite ones, but a lower bound of at least 2k for the edge-degree at the ends and the degree at the vertices does suffice to ensure the existence of (k+1)-edge-connected subgraphs in arbitrary graphs.