The Cycle Space of an Infinite Graph

Finite graph homology may seem trivial, but for infinite graphs things become interesting. We present a new ‘singular’ approach 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. Our approach permits the extension to infinite graphs of standard results about finite graph homology – such as cycle–cocycle duality and Whitney's theorem, Tutte's generating theorem, MacLane's planarity criterion, the Tutte/Nash-Williams tree packing theorem – whose infinite versions would otherwise fail. A notion of end degrees motivated by these results opens up new possibilities for an ‘extremal’ branch of infinite graph theory. Numerous open problems are suggested.

[1]  Maya Jakobine Stein,et al.  On end degrees and infinite cycles in locally finite graphs , 2007, Comb..

[2]  Reinhard Diestel,et al.  End spaces and spanning trees , 2006, J. Comb. Theory, Ser. B.

[3]  Xingxing Yu,et al.  Infinite paths in planar graphs IV, dividing cycles , 2006, J. Graph Theory.

[4]  Maya Jakobine Stein,et al.  MacLane's planarity criterion for locally finite graphs , 2006, J. Comb. Theory, Ser. B.

[5]  Henning Bruhn,et al.  Duality in Infinite Graphs , 2006, Combinatorics, Probability and Computing.

[6]  Maya Jakobine Stein,et al.  Cycle‐cocycle partitions and faithful cycle covers for locally finite graphs , 2005, J. Graph Theory.

[7]  H. Bruhn.  Infinite circuits in locally finite graphs , 2005 .

[8]  Henning Bruhn,et al.  The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits , 2004, J. Comb. Theory, Ser. B.

[9]  Reinhard Diestel,et al.  Topological paths, cycles and spanning trees in infinite graphs , 2004, Eur. J. Comb..

[10]  Reinhard Diestel,et al.  On Infinite Cycles I , 2004, Comb..

[11]  Reinhard Diestel,et al.  On Infinite Cycles II , 2004, Comb..

[12]  Reinhard Diestel,et al.  Graph-theoretical versus topological ends of graphs , 2003, J. Comb. Theory, Ser. B.

[13]  Imre Leader,et al.  Normal Spanning Trees, Aronszajn Trees and Excluded Minors , 2001 .

[14]  Rudolf Halin,et al.  Miscellaneous problems on infinite graphs , 2000, J. Graph Theory.

[15]  Péter Komjáth,et al.  Martin's axiom and spanning trees of infinite graphs , 1992, J. Comb. Theory, Ser. B.

[16]  Reinhard Diestel,et al.  The end structure of a graph: recent results and open problems , 1992, Discret. Math..

[17]  Carsten Thomassen,et al.  Infinite connected graphs with no end-preserving spanning trees , 1992, J. Comb. Theory, Ser. B.

[18]  Robin Thomas,et al.  An end-faithful spanning tree counterexample , 1991, Discret. Math..

[19]  Carsten Thomassen,et al.  Infinite, highly connected digraphs with no two arc-disjoint spanning trees , 1989, J. Graph Theory.

[20]  Carsten Thomassen,et al.  Planarity and duality of finite and infinite graphs , 1980, J. Comb. Theory B.

[21]  James G. Oxley,et al.  On a packing problem for infinite graphs and independence spaces , 1979, J. Comb. Theory, Ser. B.

[22]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[23]  Frank Harary,et al.  Graph Theory , 2016 .

[24]  C. Nash-Williams,et al.  Infinite graphs—A survey , 1967 .

[25]  C. Nash-Williams.  Decomposition of Finite Graphs Into Forests , 1964 .

[26]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[27]  C. Nash-Williams.  Edge-disjoint spanning trees of finite graphs , 1961 .

[28]  C. St. J. A. Nash-Williams,et al.  Decomposition of Graphs Into Closed and Endless Chains , 1960 .

[29]  W. T. Tutte.  A THEOREM ON PLANAR GRAPHS , 1956 .

[30]  Saunders Mac Lane,et al.  A combinatorial condition for planar graphs , 1937 .

[31]  H. Freudenthal,et al.  Über die Enden topologischer Räume und Gruppen , 1931 .