000			01807nam a22002777a 4500
003			OSt
005			20241022173235.0
008			241022b |||||||| |||| 00| 0 hin d
020			_a9783030008307
040			_aNISER LIBRARY _beng _cNISER LIBRARY
041			_aENGLISH
082			_a519.1 _bMLA-C
100			_aMladenović, Pavle
245			_aCombinatorics : _ba problem based approach
260			_aSwitzerland : _bSpringer Nature, _c2019.
300			_ax, 365p. : _b98 illustrations
490			_aProblem Books in Mathematics, _x0941-3502
520			_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.
650			_aCombinatorics
650			_aGraph theory
650			_aEnumerative combinatorics
650			_aMathematical olympiads
856			_3Table of contents _uhttps://link.springer.com/content/pdf/bfm:978-3-030-00831-4/1
856			_3Reviews _uhttps://www.goodreads.com/book/show/51057610-combinatorics#CommunityReviews
942			_2udc _cBK
999			_c35338 _d35338