000			03460nam a2200385 4500
001			OTLid0000339
003			MnU
005			20201105133320.0
006			m o d s
008			180907s2017 mnu o 0 0 eng d
020			_a
040			_aMnU _beng _cMnU
050		4	_aQA1
050		4	_aQA37.3
100	1		_aKeller, Mitchel T. _eauthor
245	0	0	_aApplied Combinatorics _cMitchel Keller
264		2	_bOpen Textbook Library
264		1	_bMitchel T. Keller, William T. Trotter
300			_a1 online resource
490	0		_aOpen textbook library.
505	0		_a1. An Introduction to Combinatorics -- 2. Strings, Sets and Binomial Coefficients -- 3. Induction -- 4. Combinatorial Basics -- 5. Graph Theory -- 6. Partially Ordered Sets -- 7. Inclusion-Exclusion -- 8. Generating Functions -- 9. Recurrence Equations -- 10. Probability -- 11. Applying Probability to Combinatorics -- 12. Graph Algorithms -- 13. Network Flows -- 14. Combinatorial Applications of Network Flows -- 15. Polya's Enumeration Theorem -- 16. The Many Faces of Combinatorics -- A. Epilogue -- B. Background Material for Combinatorics -- C. List of Notation
520	0		_aApplied Combinatorics is an open-source textbook for a course covering the fundamental enumeration techniques (permutations, combinations, subsets, pigeon hole principle), recursion and mathematical induction, more advanced enumeration techniques (inclusion-exclusion, generating functions, recurrence relations, Polyá theory), discrete structures (graphs, digraphs, posets, interval orders), and discrete optimization (minimum weight spanning trees, shortest paths, network flows). There are also chapters introducing discrete probability, Ramsey theory, combinatorial applications of network flows, and a few other nuggets of discrete mathematics. Applied Combinatorics began its life as a set of course notes we developed when Mitch was a TA for a larger than usual section of Tom's MATH 3012: Applied Combinatorics course at Georgia Tech in Spring Semester 2006. Since then, the material has been greatly expanded and exercises have been added. The text has been in use for most MATH 3012 sections at Georgia Tech for several years now. Since the text has been available online for free, it has also been adopted at a number of other institutions for a wide variety of courses. In August 2016, we made the first release of Applied Combinatorics in HTML format, thanks to a conversion of the book's source from LaTeX to MathBook XML. An inexpensive print-on-demand version is also available for purchase. Find out all about ways to get the book. Since Fall 2016, Applied Combinatorics has been on the list of approved open textbooks from the American Institute of Mathematics. Applied Combinatorics is open source and licensed under the Creative Commons Attribution-ShareAlike 4.0 International License (CC-BY-SA).
542	1		_fAttribution-ShareAlike
546			_aIn English.
588	0		_aDescription based on print resource
650		0	_aMathematics _vTextbooks
650		0	_aApplied mathematics _vTextbooks
700	1		_aTrotter, William T. _eauthor
710	2		_aOpen Textbook Library _edistributor
856	4	0	_uhttps://open.umn.edu/opentextbooks/textbooks/339 _zAccess online version
999			_c19738 _d19738