LEADER 00000cai a2200697Ia 4500 
001    ocn957559315 
003    OCoLC 
005    20210720044925.2 
006    m     o  d         
007    cr mn||||||||| 
008    160831c20169999xx uu   o     0    2eng d 
019    1090376411|a1090455629|a1090502137|a1096239765|a1097989963
020    9781534878655 
020    1534878653 
020    9781973702719 
020    1973702711 
035    (OCoLC)957559315|z(OCoLC)1090376411|z(OCoLC)1090455629
       |z(OCoLC)1090502137|z(OCoLC)1096239765|z(OCoLC)1097989963 
040    COF|beng|cCOF|dOCLCQ|dSOI|dORU|dOCLCQ|dOCL|dRRP|dINT
       |dOCLCQ|dUAB|dOCLCO|dAU@|dOCLCQ|dOCLCO 
049    RIDW 
050  4 QA164|b.K45eb 
090    QA164|b.K45eb 
100 1  Keller, Mitchel T. 
245 10 Applied combinatorics /|cMitchel T. Keller, William T. 
       Trotter. 
264  1 [Place of publication not identified] :|bMitchel T. Keller,
       William T. Trotter,|c2016- 
264  2 Minneapolis :|bOpen Textbook Library 
264  4 |c©2016- 
300    1 online resource :|billustrations (some colour). 
310    Updated irregularly. 
336    text|btxt|2rdacontent 
337    computer|bc|2rdamedia 
338    online resource|bcr|2rdacarrier 
340    |gpolychrome|2rdacc 
347    data file|2rda 
490 1  Open textbook library 
500    "This work is licensed under the Creative Commons 
       Attribution-ShareAlike 4.0 International License."--Title 
       page verso. 
500    Includes index. 
505 0  An Introduction to Combinatorics -- Strings, Sets and 
       Binomial Coefficients -- Induction -- Combinatorial Basics
       -- Graph Theory -- Partially Ordered Sets -- Inclusion-
       Exclusion -- Generating Functions -- Recurrence Equations 
       -- Probability -- Applying Probability to Combinatorics --
       Graph Algorithms -- Network Flows -- Combinatorial 
       Applications of Network Flows -- Polya's Enumeration 
       Theorem -- The Many Faces of Combinatorics. 
520    "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."--Open Textbook
       Library. 
538    Mode of access: World Wide Web. 
588    This bibliographic record is available under the Creative 
       Commons CC0 "No Rights Reserved" license. 
588 0  Online version, 2016 edition; title from PDF (viewed on 
       August 31, 2016). 
590    Open Educational Resources (OER). Open Textbooks 
590    |bOpen Textbook Library 
650  0 Combinatorial analysis.|0https://id.loc.gov/authorities/
       subjects/sh85028802 
650  0 Graph theory.|0https://id.loc.gov/authorities/subjects/
       sh85056471 
650  7 Combinatorial analysis.|2fast|0https://id.worldcat.org/
       fast/868961 
650  7 Graph theory.|2fast|0https://id.worldcat.org/fast/946584 
650  7 MATHEMATICS|xCombinatorics.|2bisacsh 
655  4 Electronic books. 
655  7 Textbooks.|2fast|0https://id.worldcat.org/fast/1423863 
655  7 Textbooks.|2lcgft|0https://id.loc.gov/authorities/
       genreForms/gf2014026191 
700 1  Trotter, William T.|0https://id.loc.gov/authorities/names/
       n91110431 
710 2  Open Textbook Library,|0https://id.loc.gov/authorities/
       names/no2015006558|edistributor. 
830  0 Open Textbook Library. 
856 40 |uhttps://open.umn.edu/opentextbooks/textbooks/339|zOnline
       textbook via the Open Textbook Library. 
901    MARCIVE 20231220 
948    |d20221222|cOpenTextbook|tadd 988 July2021-June2022|lridw 
948    |d20210720|cOpenTextbook|tinitial load 827|lridw 
994    92|bRID