The ever-expanding field of extremal graph theory encompasses a diverse array of problem-solving methods, including applications to economics, computer science, and optimization theory. This volume, based on a series of lectures delivered to graduate students at the University of Cambridge, presents a concise yet comprehensive treatment of extremal graph theory. Unlike most graph theory treatises, this text features complete proofs for almost all of its results. Further insights into theory are provided by the numerous exercises of varying degrees of difficulty that accompany each chapter. Although geared toward mathematicians and research students, much of Extremal Graph Theory is accessible even to undergraduate students of mathematics. Pure mathematicians will find this text a valuable resource in terms of its unusually large collection of results and proofs, and professionals in other fields with an interest in the applications of graph theory will also appreciate its precision and scope.

The ever-expanding field of extremal graph theory encompasses an array of problem-solving methods, including applications to economics, computer science, and optimization theory. This volume presents a concise yet comprehensive treatment, featuring complete proofs for almost all of its results and numerous exercises. 1978 edition.

Lectures given in F. Harary's seminar course, University College of London, Dept. of Mathematics, 1962-1963.

An in-depth account of graph theory, written for serious students of mathematics and computer science. It reflects the current state of the subject and emphasises connections with other branches of pure mathematics. Recognising that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavour of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory, the book presents a detailed account of newer topics, including Szemerédis Regularity Lemma and its use, Shelahs extension of the Hales-Jewett Theorem, the precise nature of the phase transition in a random graph process, the connection between electrical networks and random walks on graphs, and the Tutte polynomial and its cousins in knot theory. Moreover, the book contains over 600 well thought-out exercises: although some are straightforward, most are substantial, and some will stretch even the most able reader.

The articles in this volume present the state of the art in a variety of areas of discrete probability, including random walks on finite and infinite graphs, random trees, renewal sequences, Stein's method for normal approximation and Kohonen-type self-organizing maps. This volume also focuses on discrete probability and its connections with the theory of algorithms. Classical topics in discrete mathematics are represented as are expositions that condense and make readable some recent work on Markov chains, potential theory and the second moment method. This volume is suitable for mathematicians and students.

This is a concise, up-to-date introduction to extremal combinatorics for non-specialists. Strong emphasis is made on theorems with particularly elegant and informative proofs which may be called the gems of the theory. A wide spectrum of the most powerful combinatorial tools is presented, including methods of extremal set theory, the linear algebra method, the probabilistic method and fragments of Ramsey theory. A thorough discussion of recent applications to computer science illustrates the inherent usefulness of these methods.