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!
Extremal Graph Theory with Emphasis on Probabilistic Methods
 
A co-publication of the AMS and CBMS
Extremal Graph Theory with Emphasis on Probabilistic Methods
Softcover ISBN:  978-0-8218-0712-5
Product Code:  CBMS/62
List Price: $29.00
Individual Price: $23.20
eBook ISBN:  978-1-4704-2423-7
Product Code:  CBMS/62.E
List Price: $27.00
Individual Price: $21.60
Softcover ISBN:  978-0-8218-0712-5
eBook: ISBN:  978-1-4704-2423-7
Product Code:  CBMS/62.B
List Price: $56.00 $42.50
Extremal Graph Theory with Emphasis on Probabilistic Methods
Click above image for expanded view
Extremal Graph Theory with Emphasis on Probabilistic Methods
A co-publication of the AMS and CBMS
Softcover ISBN:  978-0-8218-0712-5
Product Code:  CBMS/62
List Price: $29.00
Individual Price: $23.20
eBook ISBN:  978-1-4704-2423-7
Product Code:  CBMS/62.E
List Price: $27.00
Individual Price: $21.60
Softcover ISBN:  978-0-8218-0712-5
eBook ISBN:  978-1-4704-2423-7
Product Code:  CBMS/62.B
List Price: $56.00 $42.50
  • Book Details
     
     
    CBMS Regional Conference Series in Mathematics
    Volume: 621986; 64 pp
    MSC: Primary 05;

    Problems in extremal graph theory have traditionally been tackled by ingenious methods which made use of the structure of extremal graphs. In this book, an update of his 1978 book Extremal Graph Theory, the author focuses on a trend towards probabilistic methods. He demonstrates both the direct use of probability theory and, more importantly, the fruitful adoption of a probabilistic frame of mind when tackling main line extremal problems.

    Essentially self-contained, the book does not merely catalog results, but rather includes considerable discussion on a few of the deeper results. The author addresses pure mathematicians, especially combinatorialists and graduate students taking graph theory, as well as theoretical computer scientists. He assumes a mature familiarity with combinatorial methods and an acquaintance with basic graph theory. The book is based on the NSF-CBMS Regional Conference on Graph Theory held at Emory University in June, 1984.

    Readership

  • Table of Contents
     
     
    • Chapters
    • 1. Subdivisions
    • 2. Contractions
    • 3. Small Graphs of Large Girth
    • 4. Large Graphs of Small Diameter
    • 5. Cycles in Dense Graphs
    • 6. The Evolution of Random Graphs
    • 7. The Size Ramsey Number of a Path
    • 8. Weakly Saturated Graphs
    • 9. List Colorings
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Accessibility – to request an alternate format of an AMS title
Volume: 621986; 64 pp
MSC: Primary 05;

Problems in extremal graph theory have traditionally been tackled by ingenious methods which made use of the structure of extremal graphs. In this book, an update of his 1978 book Extremal Graph Theory, the author focuses on a trend towards probabilistic methods. He demonstrates both the direct use of probability theory and, more importantly, the fruitful adoption of a probabilistic frame of mind when tackling main line extremal problems.

Essentially self-contained, the book does not merely catalog results, but rather includes considerable discussion on a few of the deeper results. The author addresses pure mathematicians, especially combinatorialists and graduate students taking graph theory, as well as theoretical computer scientists. He assumes a mature familiarity with combinatorial methods and an acquaintance with basic graph theory. The book is based on the NSF-CBMS Regional Conference on Graph Theory held at Emory University in June, 1984.

Readership

  • Chapters
  • 1. Subdivisions
  • 2. Contractions
  • 3. Small Graphs of Large Girth
  • 4. Large Graphs of Small Diameter
  • 5. Cycles in Dense Graphs
  • 6. The Evolution of Random Graphs
  • 7. The Size Ramsey Number of a Path
  • 8. Weakly Saturated Graphs
  • 9. List Colorings
Review Copy – for publishers of book reviews
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.