Orientations of infinite graphs with prescribed edge-connectivity

Research output: Contribution to journalJournal articleResearchpeer-review

562 Downloads (Pure)


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.
Original languageEnglish
Issue number5
Pages (from-to)601–621
Number of pages21
Publication statusPublished - 2016


Dive into the research topics of 'Orientations of infinite graphs with prescribed edge-connectivity'. Together they form a unique fingerprint.

Cite this