论文信息 - On a problem of R. Halin concerning infinite graphs II

On a problem of R. Halin concerning infinite graphs II

For every countable, connected graph A containing no one-way infinite path the following is shown: Let G be an arbitrary graph which contains for every positive integer n a system of n disjoint graphs each isomorphic to a subdivision of A. Then G also contains infinitely many disjoint subgraphs each isomorphic to a subdivision of A. In addition, corrections of errors are given that occur unfortunately in the forerunner of the present paper.

Thomas Andreae | Thomas Andreae

[1] R. Halin,et al. Über die Maximalzahl fremder unendlicher Wege in Graphen , 1965 .

[2] Thomas Andreae. Über eine eigenschaft lokalfiniter, unendlicher bäume , 1979, J. Comb. Theory, Ser. B.

[3] R. Halin. Charakterisierung der Graphen ohne unendliche Wege , 1965 .

[4] R. Halin,et al. Über unendliche Wege in Graphen , 1964 .

[5] R. Halin,et al. Die Maximalzahl fremder zweiseitig unendlicher Wege in Graphen , 1970 .

[6] R. Halin,et al. Über trennende Eckenmengen in Graphen und den Mengerschen Satz , 1964 .

[7] Douglas R. Woodall. A note on a problem of Halin's , 1976, J. Comb. Theory, Ser. B.

[8] C. Nash-Williams. On well-quasi-ordering infinite trees , 1963, Mathematical Proceedings of the Cambridge Philosophical Society.

[9] John Lake. A problem concerning infinite graphs , 1976, Discret. Math..

[10] J. Kruskal. Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture , 1960 .

[11] R. Halin. A problem in infinite graph-theory , 1975 .