论文信息 - On well-quasi-ordering-finite graphs by immersion

On well-quasi-ordering-finite graphs by immersion

AbstractIt has been conjectured by Nash-Williams that the class of all graphs is well-quasi-ordered under the quasi-order ≦ defined by immersion. Two partial results are proved which support this conjecture. (i) The class of finite simple graphsG with $$G \ngeqq K_{2,3} $$ K2,3 is well-quasi-ordered by ≦, (ii) it is shown that a class of finite graphs is well-quasi-ordered by ≦ provided that the blocks of its members satisfy certain restrictive conditions. (In particular, this second result implies that ≦ is a well-quasi-order on the class of graphs for which each block is either complete or a cycle.)

Thomas Andreae | Thomas Andreae

[1] Joseph B. Kruskal,et al. The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept , 1972, J. Comb. Theory A.

[2] W. Mader. Wohlquasigeordnete Klassen endlicher Graphen , 1972 .

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

[4] C. St. J. A. Nash-Williams,et al. A Glance at Graph Theory—Part I , 1982 .

[5] Paul D. Seymour,et al. Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[6] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .

[7] P. Seymour,et al. Some New Results on the Well-Quasi-Ordering of Graphs , 1984 .

[8] W. Mader. Homomorphieeigenschaften und mittlere Kantendichte von Graphen , 1967 .

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

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

[11] J. A. Bondy,et al. Graph Theory with Applications , 1978 .