On infinite cycles I

被引:52
作者
Diestel, R
Kühn, D
机构
[1] Univ Hamburg, Math Seminar, D-20146 Hamburg, Germany
[2] Free Univ Berlin, Inst Math, D-14195 Berlin, Germany
关键词
D O I
10.1007/s00493-004-0005-z
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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 S-1 in the graph compactified by its ends. We prove that this cycle space consists of precisely the sets of edges that meet every finite cut evenly, and that the spanning trees whose fundamental cycles generate this cycle space are precisely the end-faithful spanning trees. We also generalize Euler's theorem by showing that a locally finite connected graph with ends contains a closed topological curve traversing every edge exactly once if and only if its entire edge set lies in this cycle space.
引用
收藏
页码:69 / 89
页数:21
相关论文
共 12 条
[1]  
[Anonymous], 1960, P LOND MATH SOC, DOI DOI 10.1112/PLMS/S3-10.1.221
[2]  
[Anonymous], 1983, Basic Topology
[3]   ON SPANNING-TREES AND KAPPA-CONNECTEDNESS IN INFINITE-GRAPHS [J].
DIESTEL, R .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1992, 56 (02) :263-277
[4]   THE END STRUCTURE OF A GRAPH - RECENT RESULTS AND OPEN PROBLEMS [J].
DIESTEL, R .
DISCRETE MATHEMATICS, 1992, 100 (1-3) :313-327
[5]   Normal spanning trees, Aronszajn trees and excluded minors [J].
Diestel, R ;
Leader, I .
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2001, 63 :16-32
[6]  
Diestel R, 2004, COMBINATORICA, V24, P91, DOI [10.1007/s00493-004-0006-y, 10.1007/s00493-004-0005-z]
[7]  
DIESTEL R, IN PRESS COMB PROBAB
[8]  
DIESTEL R, IN PRESS EUROP J COM
[9]  
Diestel R., 2000, GRAPH THEORY
[10]  
Hall D. W., 1955, Elementary Topology