Skip to main content
SpringerLink
Log in

Applications of Well Quasi-Ordering and Better Quasi-Ordering

  • Chapter
Graphs and Order

Part of the book series: NATO ASI Series ((ASIC,volume 147))

Abstract

The aim of this lecture is to survey some of the striking applications of the theory of well quasi-order (wqo) and better quasi-order (bqo) and to illustrate with examples how one can use this theory with rather minimal knowledge. The applications and examples belong to the folklore of the Fraïssè school and concentrate on ordered sets and graphs. There are others, for instance the application of wqo to ring theory by G. Higman [20] and the fundamental results for graphs recently obtained by P.D. Seymour and N. Robertson. For these, refer to Cohn’s book [4] and the survey paper of P.D. Seymour and N. Robertson [37]. For other applications see the survey paper of J.B. Kruskal [24].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berge, C. (1960) Les problèmes de coloration en thèorie des graphes,Pub. Inst. Stat. Univ. Paris, 9, 123–160.

    MathSciNet  MATH  Google Scholar 

  2. Cameron, P.J. (1976) Transitivity of permutation groups on unordered sets,Math. Z., 148, 127–139.

    Article  MathSciNet  MATH  Google Scholar 

  3. Cameron, P.J. (1978) Orbits of permutations groups on unordered sets (I), (II), (III), (IV),J. London Math. Soc.,(2), 17, 410– 414; ibid (2) 23 (1981), 249–264; ibid (2) 27 (1983) 229–237; ibid (2) 27 (1983) 238–247.

    Article  MathSciNet  MATH  Google Scholar 

  4. Cohn P.M. (1981) Universal Algebra, 2nd Edition, D. Reidel, Dodrecht.

    Google Scholar 

  5. Corominas, E. (1984) On better quasi ordering countable trees,Proceedings of the conference on ordered sets and their applications (L’Arbresle, July 1982) (D. Richard and M. Pouzet eds.)Discrete Math.

    Google Scholar 

  6. Dushnik, B. and Miller, E.W. (1940) Concerning similarity transformations of linearly ordered sets,Bull. Amer. Math. Soc. 46, 322–326.

    Article  MathSciNet  Google Scholar 

  7. El-Zahar, M.H. and Rival, I. (to appear) Examples of jump-critical ordered sets,S.I.A.M. J. Discrete Alg. Meth.

    Google Scholar 

  8. El-Zahar, M.H. and Schmerl, J.H. (1984) On the size of jump- critical ordered sets,Order, Vol. 1, No. 1, 3–5.

    Article  MathSciNet  MATH  Google Scholar 

  9. Fraïssé, R. (1948) Sur la comparaison des types de relations,CR. Acad. Sc., Paris, Série A, t. 226, 987–988.

    MATH  Google Scholar 

  10. Fraïssé, R. (1953) Sur quelques classifications des systèmes de relations Thèse, Paris, 152 p. cf. Pub. Sci. Univ. Alger, Serie A (1954) 135–182.

    Google Scholar 

  11. Fraïssé, R. (1953) Sur quelques classifications des systèmes de relations Thèse, Paris, 152 p. cf. Pub. Sci. Univ. Alger, Serie A (1954) 135–182.

    Google Scholar 

  12. Fraïssé, R. (1954) Sur l’extension aux relations de quelques propriétés des ordres,Annales de l’école Normale Supérieure, 71 363–388.

    MATH  Google Scholar 

  13. Fraïssé, R. (1970) Abritement entre relations et spécialement entre chaînes,Symposia Mathematica, Vol. 5, 203–251.

    Google Scholar 

  14. Fraïssé, R. (1974) Problématique apportée par les relations en théorie des permutations, InActes du Colloque sur les permutations (Paris, 1972 ), Gauthier-Villars, Paris, 211–228.

    Google Scholar 

  15. Fraïssé, R. and Pouzet, R (1971) Interfrétabilité d’une relation par une chaîne,C.R. Acad. Sci., Paris, Serie A, 272, 1624–1627. Sur une classe de relations n’ayant qufun nombre fini de bornes Ibid 273, 275–278.

    MATH  Google Scholar 

  16. Frasnay, C. (1965) Quelques problèmes combinatoires concernant les ordres totaux et les relations monomorphes (Thèse, Paris). Ann. Inst. Fourier 15, no2, 415–524.

    Article  MathSciNet  MATH  Google Scholar 

  17. Frasnay, C. (1974) Theorème deG-recollement d’une famille d’ordres totaux. Applications aux relations monomorphes, extension aux multirelations. InActes du Colloque sur les permutations (Paris, 1972 ) Gauthier-Villars, Paris, 229–237.

    Google Scholar 

  18. Frasnay, C. (1984) Relations enchainables, rangements et pseudo rangements,Orders, Descriptions and Roles (M. Pouzet and D. Richard eds.)Annals. of Discrete Math., 235–268.

    Google Scholar 

  19. Gallai, T. (1967) Transitiv orientierbare Graphen,Acta Math. Acad. Sci. Hungar. 18, 25–66.

    Article  MathSciNet  MATH  Google Scholar 

  20. Hausdorff, F. (1908) Grundzüge einer theorie der geordneten Mengen,Math. Ann. 65, 435–505.

    Article  MathSciNet  MATH  Google Scholar 

  21. Higman, G. (1952) Ordering by divisibility in abstract algebra,Proc. London Math. Soc., (3) 2, 326, 336.

    Article  MathSciNet  MATH  Google Scholar 

  22. Jean, M. (1967) Relations monomorphes et classes universelles,C.R. Acad. Sci., Paris, Serie A, 264, 591, 593.

    MathSciNet  Google Scholar 

  23. Kelly, D. (1977) The 3-irreducible partially ordered sets,Canad. J. Math. 29, 367–383.

    Article  MathSciNet  MATH  Google Scholar 

  24. Kruskal, J.B. (1960) Well quasi ordering, the tree theorem and Vazsonyi’s conjecture,Trans. Amer. Math. Soc. 95, 210–225.

    MathSciNet  MATH  Google Scholar 

  25. Kruskal, J.B. (1972) The theory of well-quasi-ordering: a frequently discovered concept,J. Comb. Th. (A) 13, 297–305.

    Article  MathSciNet  MATH  Google Scholar 

  26. Laver, R. (1971) On Fraïsse’s order type conjecture,Ann. of Math. 93, 89–111.

    Article  MathSciNet  MATH  Google Scholar 

  27. Laver, R. (1978) Better-quasi-ordering and a class of trees, inStudies in foundations and combinatorics: Advances in Maths. Sup. Series 1, Acad. Press, N.Y.

    Google Scholar 

  28. Macpherson, H.D. (1984) Growth rates in infinite graphs and permutation groups, preprint, 22 p.

    Google Scholar 

  29. Milner, E.C. Basic wqo- and bqo- theory, this volume.

    Google Scholar 

  30. Nash-Williams, C.St.J.A. (1965) On well quasi ordering infinite trees,Proc. Camb. Philos. Soc., 61, 33–39. For other references see [28], this volume.

    Article  MathSciNet  MATH  Google Scholar 

  31. Pouzet, M. (1970) Algébre ordinale prémeilleurordonnee,C.R. Acad. Sci. Paris, Serie A, 270, 300–303.

    MathSciNet  MATH  Google Scholar 

  32. Pouzet, M. (1972) Le belordre d’abritement et ses rapports avec les bornes d’une multirelation,C.R. Acad. Sci. Paris, Ser. A, 274, 1677–1680.

    MathSciNet  MATH  Google Scholar 

  33. Pouzet, M. (1978) Condition de chaîne en théorie des relations,Israel J. of Math. Vol. 30, No. 1–2, 65–84.

    Article  MathSciNet  MATH  Google Scholar 

  34. Pouzet, M. (1981) Application de la notion de relation presque enchainable au dénombrement des restrictions finies d’une relation,Zeitschrift für Math. Logik und Grund. der Math. Vol 27, 289–332.

    Article  MathSciNet  MATH  Google Scholar 

  35. Pouzet, M. (January 1978) Sur la théorie des relations, Thèse de Doctorat d’Etat, Lyon, No78.05.

    Google Scholar 

  36. Pouzet, M. (1980) The asymptotic behavior of a class of counting functions,Combinatorics 79 part II, (M. Deza and I.G. Rosenberg, eds.)Annals of Discrete Math. 9, 223–224.

    Chapter  Google Scholar 

  37. Pouzet, M. and Zaguia, N. (1984) Ordered sets with no chains of ideals of a given type,Order 1, No. 2.

    Google Scholar 

  38. Seymour, P.D. and Robertson, N. (1984) Some new results on the well quasi ordering of graphs, Orders: Description and Roles, (M. Pouzet and D. Richard eds.) Annals. of Discrete Math. 343–353.

    Google Scholar 

  39. Sierpinski, W. (1950) Sur les types d’ordre des ensembles linéaires, Fund. Math. 37, 253–264.

    MathSciNet  MATH  Google Scholar 

  40. Trotter, W.T., and Moore, J.I. (1976) Characterization problems for graphs, partially ordered sets, lattices and families of sets, Discrete Math. 4, 361–368.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Algèbre Ordinale Département de Mathématiques, Université Claude Bernard (Lyon 1), France

    M. Pouzet

Authors
  1. M. Pouzet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Statistics, The University of Calgary, Calgary, Alberta, Canada

    Ivan Rival

Rights and permissions

Reprints and permissions

Copyright information

© 1985 D. Reidel Publishing Company

About this chapter

Cite this chapter

Pouzet, M. (1985). Applications of Well Quasi-Ordering and Better Quasi-Ordering. In: Rival, I. (eds) Graphs and Order. NATO ASI Series, vol 147. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-5315-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-5315-4_15

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-8848-0

  • Online ISBN: 978-94-009-5315-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation