000			03016nam a22005055i 4500
001			978-0-387-79711-3
003			DE-He213
005			20161121231210.0
007			cr nn 008mamaa
008			100301s2008 xxu| s |||| 0|eng d
020			_a9780387797113 _9978-0-387-79711-3
024	7		_a10.1007/978-0-387-79711-3 _2doi
050		4	_aQA150-272
072		7	_aPBD _2bicssc
072		7	_aMAT008000 _2bisacsh
082	0	4	_a511.1 _223
100	1		_aHarris, John. _eauthor.
245	1	0	_aCombinatorics and Graph Theory _h[electronic resource] / _cby John Harris, Jeffry L. Hirst, Michael Mossinghoff.
264		1	_aNew York, NY : _bSpringer New York, _c2008.
300			_aXV, 381 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aUndergraduate Texts in Mathematics, _x0172-6056
505	0		_aGraph Theory -- Combinatorics -- Infinite Combinatorics and Graphs.
520			_aThis book covers a wide variety of topics in combinatorics and graph theory. It includes results and problems that cross subdisciplines, emphasizing relationships between different areas of mathematics. In addition, recent results appear in the text, illustrating the fact that mathematics is a living discipline. The second edition includes many new topics and features: • New sections in graph theory on distance, Eulerian trails, and Hamiltonian paths. • New material on partitions, multinomial coefficients, and the pigeonhole principle. • Expanded coverage of Pólya Theory to include de Bruijn’s method for counting arrangements when a second symmetry group acts on the set of allowed colors. • Topics in combinatorial geometry, including Erdos and Szekeres’ development of Ramsey Theory in a problem about convex polygons determined by sets of points. • Expanded coverage of stable marriage problems, and new sections on marriage problems for infinite sets, both countable and uncountable. • Numerous new exercises throughout the book. About the First Edition: ". . . this is what a textbook should be! The book is comprehensive without being overwhelming, the proofs are elegant, clear and short, and the examples are well picked." — Ioana Mihaila, MAA Reviews.
650		0	_aMathematics.
650		0	_aMathematical logic.
650		0	_aDiscrete mathematics.
650		0	_aCombinatorics.
650	1	4	_aMathematics.
650	2	4	_aDiscrete Mathematics.
650	2	4	_aCombinatorics.
650	2	4	_aMathematical Logic and Foundations.
700	1		_aHirst, Jeffry L. _eauthor.
700	1		_aMossinghoff, Michael. _eauthor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9780387797106
830		0	_aUndergraduate Texts in Mathematics, _x0172-6056
856	4	0	_uhttp://dx.doi.org/10.1007/978-0-387-79711-3
912			_aZDB-2-SMA
950			_aMathematics and Statistics (Springer-11649)
999			_c510017 _d510017