Artículos relacionados a Modern Graph Theory: Vol 184 (Graduate Texts in Mathematics)
Sinopsis
This text is an in-depth account of graph theory. It reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains 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 such as colouring, matching, extremal theory, and algebraic graph theory, the 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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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.
Reseña del editor
This text is an in-depth account of graph theory. It reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains 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 such as colouring, matching, extremal theory, and algebraic graph theory, the 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.
"Sobre este título" puede pertenecer a otra edición de este libro.
- EditorialSpringer-Verlag New York Inc.
- Año de publicación1998
- ISBN 10 0387984917
- ISBN 13 9780387984919
- EncuadernaciónTapa dura
- IdiomaInglés
- Número de páginas410
- Contacto del fabricanteno disponible
(Ningún ejemplar disponible)
Buscar: Crear una petición¿No encuentra el libro que está buscando? Seguiremos buscando por usted. Si alguno de nuestros vendedores lo incluye en IberLibro, le avisaremos.
Crear una petición
