Abstract
The recent proof of Robertson and Seymour that graphs are well-quasi-ordered under minors immediately implies that a number of intesting problems have polynomial time algorithms. However, partially because of their non-constructive nature, these proofs do not yield any information about the algorithms. Here we present a constructive proof that trees are well-quasi-ordered under minors. This extends the results of Murty and Russell [MR90] who give a constructive proof of Higman's Lemma. Our proof is based on transforming finite sequences of trees to ordinals. We begin by describing a transformation which carries trees to finite strings of numbers and give an ordering on these strings which preserves the minor ordering on the underlying trees. We show that in our well-quasi-ordering argument, these strings are actually over a finite alphabet. This allows us to conclude the result. We require the well-ordering of the ordinal ε0 for our proof.
Research supported by the Natural Sciences and Engineering Research Council of Canada, the Centre for System Sciences and the President's Research Grant, Simon Fraser University. A detailed exposition of these results appear in the author's dissertation [Gup90].
Preview
Unable to display preview. Download preview PDF.
References
D. Bienstock, N. Robertson, P. Seymour, and R. Thomas. Quickly excluding a forest, 1989. in preparation.
G. Cantor. Contributions to the Founding of the Theory of Transfinite Numbers. Dover Publications, New York, 1915. Translated by Philip E.B. Jourdain.
M. Fellows and M. Langston. Nonconstructive tools for proving polynomial-time decidability. Journal of the Association for Computing Machinery, 35(3):727–739, July 1988.
H. Friedman. Classically and intuitionistically provably recursive functions. In G.H. Müller and D.S. Scott, editors, Higher set theory, volume 669, pages 21–28. Springer-Verlag, Berlin, 1978.
H. Friedman. Personal communication, 1990.
A. Gupta. Constructivity Issues in Tree Minors. PhD thesis, Dept. of Computer Science, University of Toronto, Toronto, Canada, 1990. Also Appears as Technical Report 244/90, Dept. of Computer Science, University of Toronto.
A. Gupta. A regular expression characterization of minor closed tree families, 1991. in preparation.
G. Higman. Ordering by divisibility in abstract algebra. Proc. London Math. Soc., 3:326–336,1952.
J. Kruskal. Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture. Trans. Amer. Math Soc., 95:210–225, 1960.
D. Leivant. Syntactic translations and provably recursive functions. The Journal of Symbolic Logic, 50:682–688, 1985.
C. Murthy and J. Russell. A constructive proof of Higman's lemma. In Logic in Computer Science, 1990.
C.St.J.A. Nash-Williams. On well-quasi-ordering finite trees. Proc. Cambridge Phil. Soc., 59:833–835, 1963.
N. Robertson and P. Seymour. Graph Minors XIII. The disjoint paths problem. in preparation.
N. Robertson and P. Seymour. Graph Minors XV. Wagner's conjecture. in preparation.
R. Thomas. A Menger-like property of tree-width. The finite case. J. Combinatorial Theory (Ser. B), 1990. to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, A. (1992). A constructive proof that tree are well-quasi-ordered under minors (detailed abstract). In: Nerode, A., Taitslin, M. (eds) Logical Foundations of Computer Science — Tver '92. LFCS 1992. Lecture Notes in Computer Science, vol 620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023872
Download citation
DOI: https://doi.org/10.1007/BFb0023872
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55707-4
Online ISBN: 978-3-540-47276-6
eBook Packages: Springer Book Archive