Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Excluding Infinite Clique Minors
 
Neil Robertson Ohio State University
Paul Seymour Bellcore
Robin Thomas Georgia Institute of Technology
Excluding Infinite Clique Minors
eBook ISBN:  978-1-4704-0145-0
Product Code:  MEMO/118/566.E
List Price: $42.00
MAA Member Price: $37.80
AMS Member Price: $25.20
Excluding Infinite Clique Minors
Click above image for expanded view
Excluding Infinite Clique Minors
Neil Robertson Ohio State University
Paul Seymour Bellcore
Robin Thomas Georgia Institute of Technology
eBook ISBN:  978-1-4704-0145-0
Product Code:  MEMO/118/566.E
List Price: $42.00
MAA Member Price: $37.80
AMS Member Price: $25.20
  • Book Details
     
     
    Memoirs of the American Mathematical Society
    Volume: 1181996; 103 pp
    MSC: Primary 05

    Two of the authors proved a well-known conjecture of K. Wagner, that in any infinite set of finite graphs there are two graphs so that one is a minor of the other. A key lemma was a theorem about the structure of finite graphs that have no \(K_n\) minor for a fixed integer \(n\). Here, the authors obtain an infinite analog of this lemma—a structural condition on a graph, necessary and sufficient for it not to contain a \(K_n\) minor, for any fixed infinite cardinal \(n\).

    Readership

    Research mathematicians in infinite graph theory.

  • Table of Contents
     
     
    • Chapters
    • 1. Introduction
    • 2. Dissections
    • 3. Havens and minors
    • 4. Clustered havens of order $\aleph _0$
    • 5. The easy halves
    • 6. Divisions
    • 7. Long divisions
    • 8. Robust divisions
    • 9. Limited dissections
    • 10. Excluding the half-grid
    • 11. Excluding $K_{\aleph _0}$
    • 12. Dissections and tree-decompositions
    • 13. Topological trees
    • 14. Well-founded trees
    • 15. Well-founded tree-decompositions
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Volume: 1181996; 103 pp
MSC: Primary 05

Two of the authors proved a well-known conjecture of K. Wagner, that in any infinite set of finite graphs there are two graphs so that one is a minor of the other. A key lemma was a theorem about the structure of finite graphs that have no \(K_n\) minor for a fixed integer \(n\). Here, the authors obtain an infinite analog of this lemma—a structural condition on a graph, necessary and sufficient for it not to contain a \(K_n\) minor, for any fixed infinite cardinal \(n\).

Readership

Research mathematicians in infinite graph theory.

  • Chapters
  • 1. Introduction
  • 2. Dissections
  • 3. Havens and minors
  • 4. Clustered havens of order $\aleph _0$
  • 5. The easy halves
  • 6. Divisions
  • 7. Long divisions
  • 8. Robust divisions
  • 9. Limited dissections
  • 10. Excluding the half-grid
  • 11. Excluding $K_{\aleph _0}$
  • 12. Dissections and tree-decompositions
  • 13. Topological trees
  • 14. Well-founded trees
  • 15. Well-founded tree-decompositions
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.