- We will send in 10–14 business days.
/images/books/2892605/9780198532101.jpg)
- Author: Reinhard Diestel
- Publisher: Clarendon Press
- ISBN-10: 0198532105
- ISBN-13: 9780198532101
- Format: 16.2 x 23.5 x 2.2 cm, kieti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
This is the first book to offer a complete account of the theory of simplicial decompositions of graphs, possibly the single most important tool in infinite graph theory. The text is centered on a number of guiding problems and concepts such as the existence and uniqueness problem of simplicial decompositions into primes, and the concept of excluded minors as a means of identifying a desired structure. Following theoretical developments since the 1930s, the author includes extensive information on the current state of research, as well as many examples, proof strategies, exercises, and ongoing problems. The book will be a useful resource for graph theorists and mathematicians, and its lively account of important research will interest advanced students as well.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 23d.18:10:28
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Reinhard Diestel
- Publisher: Clarendon Press
- ISBN-10: 0198532105
- ISBN-13: 9780198532101
- Format: 16.2 x 23.5 x 2.2 cm, kieti viršeliai
- Language: English English
This is the first book to offer a complete account of the theory of simplicial decompositions of graphs, possibly the single most important tool in infinite graph theory. The text is centered on a number of guiding problems and concepts such as the existence and uniqueness problem of simplicial decompositions into primes, and the concept of excluded minors as a means of identifying a desired structure. Following theoretical developments since the 1930s, the author includes extensive information on the current state of research, as well as many examples, proof strategies, exercises, and ongoing problems. The book will be a useful resource for graph theorists and mathematicians, and its lively account of important research will interest advanced students as well.
Reviews