Orientations of infinite graphs with prescribed edge-connectivity
- 113 Downloads
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.
Mathematics Subject Classification (2000)05C40 05C20
Unable to display preview. Download preview PDF.
- J. A. Bondy and U. S. R. Murty: Graph Theory with Applications, The MacMillanPress Ltd. (1976).Google Scholar
- C. St. J. A. Nash-Williams: Unexplored and semi-explored territories in graphtheory, in: New Directions in the Theory of Graphs (Proc. Third Ann Arbor Conf.,Univ. Michigan, Ann Arbor, MI, 1971), Academic Press, New York (1973), 149–186.Google Scholar
- C. Thomassen: Infinite graphs, in: Further Selected Topics in Graph Theory (L.W. Beineke and R.J. Wilson, eds.), Academic Press, London (1983), 129–160.Google Scholar