首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Connected but not path-connected subspaces of infinite graphs
Authors:Angelos Georgakopoulos
Institution:1.Mathematisches Seminar der Universit?t Hamburg Department Mathematik,Schwerpunkt Geometrie und Diskrete Mathematik,Hamburg,Germany
Abstract:Solving a problem of Diestel 9] relevant to the theory of cycle spaces of infinite graphs, we show that the Freudenthal compactification of a locally finite graph can have connected subsets that are not path-connected. However we prove that connectedness and path-connectedness to coincide for all but a few sets, which have a complicated structure.
Keywords:Mathematics Subject Classification (2000)" target="_blank">Mathematics Subject Classification (2000)  05C10
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号