Extremal graph theory with emphasis on probabilistic methods
Author(s)
Bibliographic Information
Extremal graph theory with emphasis on probabilistic methods
（Regional conference series in mathematics, no. 62）
Published for the Conference Board of the Mathematical Sciences by the American Mathematical Society, c1986
Available at / 41 libraries
-
No Libraries matched.
- Remove all filters.
Note
"Based on the marathon lecture series given at the NSF-CBMS Regional Conference on Extremal Graph Theory held in June 1984 at Emory University, Atlanta"--Pref
Bibliography: p. 61-64
Description and Table of Contents
Description
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.
Table of Contents
Subdivisions Contractions Small graphs of large girth Large graphs of small diameter Cycles in dense graphs The evolution of random graphs The size Ramsey number of a path Weakly saturated graphs List colourings.
by "Nielsen BookData"