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
Conflict-free coloring
TL;DR: For the problem of conlict-free coloring points with respect to a given set of intervals, an efficient algorithm is described that computes a coloring with at most twice the number of colors of an optimal coloring, and it is shown that there is a family of inputs that force the algorithm to use two times the number to use an optimal solution.
Journal ArticleDOI
Fragmentation: loss of global coherence or breakdown of modularity in functional brain architecture?
TL;DR: It is demonstrated that with decreasing connectivity, the probability of evolving into a modular small-world network breaks down at a critical point, which scales to the percolation function of random networks with a universal exponent of α = 1.17.
Posted Content
Random Max SAT, Random MAXCUT, and Their Phase Transitions
TL;DR: It is shown that the optimization problem MAX 2-SAT undergoes a phase transition just as the 2- SAT decision problem does, and at the same critical value c = 1, as well as analogous results for random MAX CUT.
Network analysis of a tourism destination
TL;DR: In this paper, a tourism destination is analyzed as a dynamic evolving complex system with the series of techniques and methods drawn from the area of network analysis, and the authors apply methods and techniques of so-called network science in order to study the evolution of the destination system and to simulate dynamic processes such as information and knowledge diffusion, and efficiency optimisation.
Proceedings ArticleDOI
Spanning Edge Centrality: Large-scale Computation and Applications
TL;DR: This article shows that, relative to common centrality measures, spanning centrality is more effective in identifying edges whose removal causes a higher disruption in an information propagation procedure, while being very resilient to noise, in terms of both the edges scores and the resulting edge ranking.