A Course in Topological Combinatorics (Hardcover, 2012)

A Course in Topological Combinatorics is the first undergraduate textbook on the field of topological combinatorics, a subject that has become an active and innovative research area in mathematics over the last thirty years with growing applications in math, computer science, and other applied areas. Topological combinatorics is concerned with solutions to combinatorial problems by applying topological tools. In most cases these solutions are very elegant and the connection between combinatorics and topology often arises as an unexpected surprise. The textbook covers topics such as fair division, graph coloring problems, evasiveness of graph properties, and embedding problems from discrete geometry. The text contains a large number of figures that support the understanding of concepts and proofs. In many cases several alternative proofs for the same result are given, and each chapter ends with a series of exercises. The extensive appendix makes the book completely self-contained. The textbook is well suited for advanced undergraduate or beginning graduate mathematics students. Previous knowledge in topology or graph theory is helpful but not necessary. The text may be used as a basis for a one- or two-semester course as well as a supplementary text for a topology or combinatorics class.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Universitext
Release date:	September 2012
First published:	2013
Authors:	Mark de Longueville
Dimensions:	235 x 155 x 22mm (L x W x T)
Format:	Hardcover
Pages:	240
Edition:	2012
ISBN-13:	978-1-4419-7909-4
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
LSN:	1-4419-7909-3
Barcode:	9781441979094

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!