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
Dissertation
From graphs to matrices, and back: new techniques for graph algorithms
TL;DR: This thesis develops a toolkit that combines a diverse set of modern algorithmic techniques, including sparsification, low-stretch spanning trees, the multiplicative-weights-update method, dynamic graph algorithms, fast Laplacian system solvers, and tools of spectral graph theory to obtain improved algorithms for several basic graph problems.
Journal ArticleDOI
Δ-List vertex coloring in linear time
TL;DR: This work presents a new proof of a theorem of Erdos, Rubin, and Taylor, which states that the list chromatic number of a connected, simple graph that is neither complete nor an odd cycle does not exceed its maximum degree, and yields the first-known linear-time algorithm to list-color graphs satisfying the hypothesis of the theorem.
Journal ArticleDOI
Recursive solutions for Laplacian spectra and eigenvectors of a class of growing treelike networks.
TL;DR: The analytical method opens the way to analytically compute the eigenvalues and eigenvectors of some other deterministically growing treelike networks, making it possible to accurately calculate their spectral characteristics.
Journal ArticleDOI
Minimum Weakly Fundamental Cycle Bases Are Hard To Find
TL;DR: This paper settles the complexity status of the MCB problem for WFCB’s (the MWFCB problem) and offers a simple and practical 2⌈log 2n⌉-approximation algorithm for the MW FCB problem.
Journal ArticleDOI
Similarity search for local protein structures at atomic resolution by exploiting a database management system
Akira R. Kinjo,Haruki Nakamura +1 more
TL;DR: Applications of this method to several protein structures clearly shows that significant similarities can be detected between local structures of non-homologous as well as homologous proteins.