Graph Decompositions is the first book on a topic that belongs mainly to infinite graph theory. It offers a complete account of the theory of simplicial decompositions of graphs, from its origins in the 1930s right up to present-day research. In addition to being one of the most important tools in infinite graph theory, simplicial decompositions may be seen as a model for any kind of structural graph decomposition. The currently topical tree-decompositions, for example, have their origin in simplicial decompositions. The text is centred around a few guiding problems and concepts, such as the existence and the uniqueness problem of simplicial decompositions into primes, or the concept of excluded minors as a means of identifying a desired structure.It attempts to give as authentic a picture as possible of research in progress. To this end, it includes discussions of examples, proof strategies on the formation of new concepts, as well as numerous exercises and open problems. Graph Decompositions should prove attractive to any graph theorist or other mathematician interested in a new area of research, as well as to the advanced student looking for a lively and inspiring account of how such research evolves.
Reviews
'The book is undoubtedly a valuable addition to the literature of infinite graph theory' London Mathematical Society



Book Information
ISBN 9780198532101
Author Reinhard Diestel
Format Hardback
Page Count 242
Imprint Clarendon Press
Publisher Oxford University Press
Weight(grams) 532g
Dimensions(mm) 242mm * 163mm * 19mm