Open AccessBook
Modern graph theory
Reads0
Chats0
TLDR
This book presents an account of newer topics, including Szemer'edi's Regularity Lemma and its use; Shelah's 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.Abstract:
The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing 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 flavor of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed account of newer topics, including Szemer\'edi's Regularity Lemma and its use, Shelah's 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. In no other branch of mathematics is it as vital to tackle and solve challenging exercises in order to master the subject. To this end, the book contains an unusually large number of well thought-out exercises: over 600 in total. Although some are straightforward, most of them are substantial, and others will stretch even the most able reader.read more
Citations
More filters
Journal ArticleDOI
Modeling systemic risk with Markov switching graphical SUR models
TL;DR: In this article, a Markov Switching Graphical Seemingly Unrelated Regression (MS-GSUR) model is proposed to investigate time-varying systemic risk based on a range of multi-factor asset pricing models.
Journal ArticleDOI
Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity
TL;DR: This work considers a quantum computer consisting of n spins with an arbitrary but fixed pair-interaction Hamiltonian and describes how to simulate other pair- interactions by interspersing the natural time evolution with fast local transformations.
Journal ArticleDOI
Sobolev spaces on graphs
TL;DR: In this paper, discrete analogues of Sobolev spaces of smooth functions of graphs are considered, and new results on Banach-space-theoretical properties of such spaces are presented.
Journal ArticleDOI
On the distribution of the domination number for random class cover catch digraphs
TL;DR: The main result is the exact distribution of the domination number for a data-driven model of random interval catch digraphs, motivated by applications in machine learning and statistical pattern recognition.
Journal ArticleDOI
Fluid models of integrated traffic and multipath routing
Peter Key,Laurent Massoulié +1 more
TL;DR: A stochastic model describing the varying number of flows in a network that extends the model of Key, Massoulié, Bain and Kelly by allowing more general bandwidth allocation criteria is considered, and the dynamics of the system under a fluid scaling are analysed.