On Burgess's theorem and related problems期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

按检索

On Burgess's theorem and related problems

Authors:	Hisao Kato Xiangdong Ye

Institution:	Institute of Mathematics, University of Tsukuba, Tsukuba-Shi Ibaraki, 305, Japan ; Department of Mathematics, University of Science and Technology of China, Hefei, Anhui, 230026, People's Republic of China

Abstract:	Let be a graph. We determine all graphs which are -like. We also prove that if $G_{i} (i=1,2,\ldots , m)$ are graphs, then in order that each $G_{i}$ -like $(i=1,2,\ldots , m)$ continuum be -indecomposable for some it is necessary and sufficient that if is a graph, then is not $G_{i}$ -like for some integer with $1\le i\le m$ . This generalizes a well known theorem of Burgess.

Keywords:	Graph $n$-indecomposable $\epsilon$-map Burgess's theorem

	点击此处可从《Proceedings of the American Mathematical Society》浏览原始摘要信息
	点击此处可从《Proceedings of the American Mathematical Society》下载免费的PDF全文