LEADER 03186nam  22005415  450 
001 9910338253303321
005 20200703133812.0
010   $a3-030-00831-2
024 7 $a10.1007/978-3-030-00831-4
035   $a(CKB)4100000007810228
035   $a(DE-He213)978-3-030-00831-4
035   $a(MiAaPQ)EBC5923033
035   $a(PPN)235232092
035   $a(EXLCZ)994100000007810228
100   $a20190313d2019      u|         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aCombinatorics $eA Problem-Based Approach /$fby Pavle Mladenovi?
205   $a1st ed. 2019.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2019.
215   $a1 online resource (X, 365 p. 98 illus.) 
225 1 $aProblem Books in Mathematics,$x0941-3502
311   $a3-030-00830-4 
320   $aIncludes bibliographical references and index.
327   $aChapter 1- Arrangements, Permutations, and Combinations -- Chapter 2- Binomial and Multinomial Theorems -- Chapter 3- Inclusion-Exclusion Principle -- Chapter 4- Generating Functions -- Chapter 5- Partitions -- Chapter 6- Burnside's Lemma -- Chapter 7- Graph Theory: Part 1 -- Chapter 8- Graph Theory: Part 2 -- Chapter 9- Existence of Combinatorial Congurations -- Chapter 10- Mathematical Games -- Chapter 11- Elementary Probability -- Chapter 12- Additional Problems -- Solutions to Exercises and Problems -- References -- Index.
330   $aThis text provides a theoretical background for several topics in combinatorial mathematics, such as enumerative combinatorics (including partitions and Burnside's lemma), magic and Latin squares, graph theory, extremal combinatorics, mathematical games and elementary probability. A number of examples are given with explanations while the book also provides more than 300 exercises of different levels of difficulty that are arranged at the end of each chapter, and more than 130 additional challenging problems, including problems from mathematical olympiads. Solutions or hints to all exercises and problems are included. The book can be used by secondary school students preparing for mathematical competitions, by their instructors, and by undergraduate students. The book may also be useful for graduate students and for researchers that apply combinatorial methods in different areas.
410  0$aProblem Books in Mathematics,$x0941-3502
606   $aCombinatorial analysis
606   $aGraph theory
606   $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010
606   $aGraph Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/M29020
615  0$aCombinatorial analysis.
615  0$aGraph theory.
615 14$aCombinatorics.
615 24$aGraph Theory.
676   $a511.6
676   $a511.6
700   $aMladenovi?$b Pavle$4aut$4http://id.loc.gov/vocabulary/relators/aut$0781295
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910338253303321
996   $aCombinatorics$91732396
997   $aUNINA