Applied Combinatorics

Applied 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, recurrenc...

Full description

Saved in:
Bibliographic Details
Main Authors: Keller, Mitchel T. (Author), Trotter, William T. (Author)
Format: Electronic eBook
Language:English
Published: Sioux City, Iowa Mitchel T. Keller, William T. Trotter [2017]
Series:Open textbook library.
Subjects:
Online Access:Access online version
Tags: Add Tag
No Tags, Be the first to tag this record!

MARC

LEADER 00000nam a2200000 i 4500
001 OTLid0000339
003 MnU
005 20240122145220.0
006 m o d s
007 cr
008 180907s2017 mnu o 0 0 eng d
020 |a 9781973702719 
040 |a MnU  |b eng  |c MnU 
050 4 |a QA1 
050 4 |a QA37.3 
100 1 |a Keller, Mitchel T.  |e author 
245 0 0 |a Applied Combinatorics  |c Mitchel Keller 
264 2 |a Minneapolis, MN  |b Open Textbook Library 
264 1 |a Sioux City, Iowa  |b Mitchel T. Keller, William T. Trotter  |c [2017] 
264 4 |c ©2017. 
300 |a 1 online resource 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 0 |a Open textbook library. 
505 0 |a 1. 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 |a Applied 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 |f Attribution-ShareAlike 
546 |a In English. 
588 0 |a Description based on print resource 
650 0 |a Mathematics  |v Textbooks 
650 0 |a Applied mathematics  |v Textbooks 
700 1 |a Trotter, William T.  |e author 
710 2 |a Open Textbook Library  |e distributor 
856 4 0 |u https://open.umn.edu/opentextbooks/textbooks/339  |z Access online version