Journal article
Orientations of infinite graphs with prescribed edge-connectivity
We prove a decomposition result for locally finite graphs which can be used to extend results on edge-connectivity from finite to infinite graphs. It implies that every 4k-edge-connected graph G contains an immersion of some finite 2k-edge-connected Eulerian graph containing any prescribed vertex set (while planar graphs show that G need not containa subdivision of a simple finite graph of large edge-connectivity).
Also, every 8k-edge connected infinite graph has a k-arc-connected orientation, as conjectured in 1989.
Language: | English |
---|---|
Publisher: | Springer Berlin Heidelberg |
Year: | 2016 |
Pages: | 601-621 |
ISSN: | 14396912 and 02099683 |
Types: | Journal article |
DOI: | 10.1007/s00493-015-3173-0 |
ORCIDs: | Thomassen, Carsten |