000			01501nam a2200205 4500
001			15433993
010			_a 2008038478
020			_a9789353433062
082	0	0	_a511.6 _bBRU/I
100	1		_aBrualdi, Richard A
245	1	0	_aIntroductory combinatorics
250			_a5
260			_aNoida _bPearson _c2020
300			_axii, 605 p. _bill. ;
520			_aIntroductory Combinatorics emphasizes combinatorial ideas, including the pigeon-hole principle, counting techniques, permutations and combinations, Polya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, and combinatortial structures (matchings, designs, graphs). Written to be entertaining and readable, this book's lively style reflects the author's joy for teaching the subject. It presents an excellent treatment of Polya's Counting Theorem that doesn't assume the student is familiar with group theory. It also includes problems that offer good practice of the principles it presents. The third edition of Introductory Combinatorics has been updated to include new material on partially ordered sets, Dilworth's Theorem, partitions of integers and generating functions. In addition, the chapters on graph theory have been completely revised. A valuable book for any reader interested in learning more about combinatorics.
650		0	_aCombinatorial analysis
650		0	_aComputer science
856	4	1	_uhttp://www.loc.gov/catdir/toc/ecip0827/2008038478.html
942			_cBK
999			_c66934 _d66934