Remote Access Transactions of the American Mathematical Society
Green Open Access

Transactions of the American Mathematical Society

ISSN 1088-6850(online) ISSN 0002-9947(print)

 
 

 

Excluding infinite trees


Authors: P. D. Seymour and Robin Thomas
Journal: Trans. Amer. Math. Soc. 335 (1993), 597-630
MSC: Primary 05C75; Secondary 03E05, 03E35, 05C05
DOI: https://doi.org/10.1090/S0002-9947-1993-1079058-6
MathSciNet review: 1079058
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: For each infinite cardinal $ \kappa $ we give several necessary and sufficient conditions for a graph not to contain a minor isomorphic to the infinite $ \kappa $-branching tree in terms of a certain kind of a "tree-decomposition," in terms of a "path-decomposition," and also in terms of a "cops-and-robber game." We also give necessary and sufficient conditions for a graph not to contain a subgraph isomorphic to a subdivision of the same tree.


References [Enhancements On Off] (What's this?)

  • [1] D. Bienstock, N. Roberston, P. D. Seymour, and R. Thomas, Quickly excluding a forest, J. Combin. Theory Ser. B 52 (1991), 274-283. MR 1110475 (92f:05034)
  • [2] R. Halin, Charakterisierung der Graphen ohne unendliche Wege, Arch. Math. 16 (1965), 227-231. MR 0179104 (31:3355)
  • [3] -, Über unendliche Wege in Graphen, Math. Ann. 157 (1964), 125-137. MR 0170340 (30:578)
  • [4] R. Laver, Better-quasi-ordering and a class of trees, Studies in Foundations and Combinatorics, Adv. Math. Suppl. Stud., vol. 1, Academic Press, Orlando, 1978. MR 520553 (80c:06005)
  • [5] N. Robertson and P. D. Seymour, Graph minors. I, Excluding a forest, J. Combin. Theory Ser. B 35 (1983), 39-61. MR 723569 (85d:05148)
  • [6] N. Robertson, P. D. Seymour, and R. Thomas, Excluding infinite clique minors (submitted).
  • [7] P. D. Seymour and R. Thomas, An end-faithful spanning tree counterexample, Proc. Amer. Math. Soc. 113 (1991), 1163-1171. MR 1045600 (92c:05050)
  • [8] -, Graph searching, and a minimax theorem for tree-width, J. Combin. Theory Ser. B (to appear).

Similar Articles

Retrieve articles in Transactions of the American Mathematical Society with MSC: 05C75, 03E05, 03E35, 05C05

Retrieve articles in all journals with MSC: 05C75, 03E05, 03E35, 05C05


Additional Information

DOI: https://doi.org/10.1090/S0002-9947-1993-1079058-6
Article copyright: © Copyright 1993 American Mathematical Society

American Mathematical Society