000			03333nam a22004935i 4500
001			978-1-4419-7910-0
003			DE-He213
005			20140220082803.0
007			cr nn 008mamaa
008			120917s2013 xxu| s |||| 0|eng d
020			_a9781441979100 _9978-1-4419-7910-0
024	7		_a10.1007/978-1-4419-7910-0 _2doi
050		4	_aQA164-167.2
072		7	_aPBV _2bicssc
072		7	_aMAT036000 _2bisacsh
082	0	4	_a511.6 _223
100	1		_aLongueville, Mark. _eauthor.
245	1	2	_aA Course in Topological Combinatorics _h[electronic resource] / _cby Mark Longueville.
264		1	_aNew York, NY : _bSpringer New York : _bImprint: Springer, _c2013.
300			_aXII, 238 p. 153 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aUniversitext, _x0172-5939
505	0		_aPreface -- List of Symbols and Typical Notation -- 1 Fair-Division Problems -- 2 Graph-Coloring Problems -- 3 Evasiveness of Graph Properties -- 4 Embedding and Mapping Problems -- A Basic Concepts from Graph Theory -- B Crash Course in Topology -- C Partially Ordered Sets, Order Complexes, and Their Topology -- D Groups and Group Actions -- E Some Results and Applications from Smith Theory -- References -- Index.
520			_aA 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.
650		0	_aMathematics.
650		0	_aCombinatorics.
650		0	_aDiscrete groups.
650	1	4	_aMathematics.
650	2	4	_aCombinatorics.
650	2	4	_aConvex and Discrete Geometry.
650	2	4	_aGraph Theory.
650	2	4	_aGame Theory, Economics, Social and Behav. Sciences.
650	2	4	_aMathematics of Algorithmic Complexity.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9781441979094
830		0	_aUniversitext, _x0172-5939
856	4	0	_uhttp://dx.doi.org/10.1007/978-1-4419-7910-0
912			_aZDB-2-SMA
999			_c94468 _d94468