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
Book ChapterDOI
Relational link-based ranking
TL;DR: A generalized ranking framework is provided that can be extended to extend the PageRank link analysis algorithm to relational databases and give this extension a random querier interpretation, and explores the properties of database graphs.
Journal ArticleDOI
Loop-erased walks and total positivity
TL;DR: In this paper, the authors consider matrices whose elements enumerate weights of walks in planar directed weighted graphs (not necessarily acyclic) and show that all their minors are formal power series in edge weights with nonnegative coefficients.
Journal ArticleDOI
On distinguishing trees by their chromatic symmetric functions
TL;DR: It is proved that S"T= , where is the Hall inner product on symmetric functions and @F is a certain symmetric function that does not depend on T, which is a stronger isomorphism invariant than the subtree polynomial.
Journal ArticleDOI
Scalable Variational Integrators for Constrained Mechanical Systems in Generalized Coordinates
TL;DR: A technique to implement scalable variational integrators for generic mechanical systems in generalized coordinates that uses recursive equations, and caches calculated values, to scale to large systems by the use of generalized coordinates.
Book
Algorithms and Models for Network Data and Link Analysis
TL;DR: This book is a guide to both basic and advanced techniques and algorithms for extracting useful information from network data and is intended primarily for computer scientists, engineers, statisticians and physicists, but it is also accessible to network scientists based in the social sciences.