Volume: 62; 1986; 64 pp; Softcover
MSC: Primary 05;
Print ISBN: 978-0-8218-0712-5
Product Code: CBMS/62
List Price: $27.00
Individual Price: $21.60
Electronic ISBN: 978-1-4704-2423-7
Product Code: CBMS/62.E
List Price: $25.00
Individual Price: $20.00
Extremal Graph Theory with Emphasis on Probabilistic Methods
Share this pageBéla Bollobás
A co-publication of the AMS and CBMS
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
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
Table of Contents
Extremal Graph Theory with Emphasis on Probabilistic Methods
- Cover Cover11 free
- Title i2 free
- Copyright ii3 free
- Contents iii4 free
- Preface v6 free
- 1. Subdivisions 110 free
- 2. Contractions 716
- 3. Small Graphs of Large Girth 1322
- 4. Large Graphs of Small Diameter 1928
- 5. Cycles in Dense Graphs 2534
- 6. The Evolution of Random Graphs 3746
- 7. The Size Ramsey Number of a Path 4554
- 8. Weakly Saturated Graphs 4958
- 9. List Colorings 5564
- References 6170
- Back Cover Back Cover174