國立高雄大學圖資館 |

Language: English

Back

Introductory combinatorics /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Introductory combinatorics /Richard A. Brualdi.
Author:	Brualdi, Richard A.
Published:	Upper Saddle River, N.J. :Pearson/Prentice Hall,c2010.
Description:	xii, 605 p. :ill. ;24 cm.
Subject:	Combinatorial analysisCongresses.
Online resource:	http://www.loc.gov/catdir/toc/ecip0827/2008038478.html
ISBN:	9780136020400 (hbk. : alk. paper)

Introductory combinatorics /
Brualdi, Richard A.

Introductory combinatorics /Richard A. Brualdi. - 5th ed. - Upper Saddle River, N.J. :Pearson/Prentice Hall,c2010. - xii, 605 p. :ill. ;24 cm.

Includes bibliographical references (p. 596-597) and index.

1. What is Combinatorics? --- 2. The Pigeonhole Principle --- 3. Permutations and Combinations --- 4. Generating Permutations and Combinations --- 5. The Binomial Coefficients --- 6. The Inclusion-Exclusion Principle and Applications --- 7. Recurrence Relations and Generating Functions --- 8. Special Counting Sequences --- 9. Systems of Distinct Representatives --- 10. Combinatorial Designs --- 11. Introduction to Graph Theory --- 12. More on Graph Theory --- 13. Digraphs and Networks --- 14. P�olya Counting.

Introductory 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.

ISBN: 9780136020400 (hbk. : alk. paper)

LCCN: 2008038478Subjects--Topical Terms:

384513
Combinatorial analysis
--Congresses.

LC Class. No.: QA164 / .B76 2010

Dewey Class. No.: 511/.6

Introductory combinatorics /
LDR:02318cam 2200241 a 4500 001 285108
005 20100622110752.0
008 110513s2010 njua b 001 0 eng
010 $a 2008038478
020 $a 9780136020400 (hbk. : alk. paper)
020 $a 0136020402 (hbk. : alk. paper)
035 $a (OCoLC)ocn245024866
035 $a 15433993
040 $a DLC $c DLC $d C#P $d BWX $d YDXCP $d SINIE $d ALAUL $d BTCTA $d DLC
050 0 0 $a QA164 $b .B76 2010
082 0 0 $a 511/.6 $2 22
100 1 $a Brualdi, Richard A. $3 190924
245 1 0 $a Introductory combinatorics / $c Richard A. Brualdi.
250 $a 5th ed.
260 # $a Upper Saddle River, N.J. : $b Pearson/Prentice Hall, $c c2010.
300 $a xii, 605 p. : $b ill. ; $c 24 cm.
504 $a Includes bibliographical references (p. 596-597) and index.
505 1 # $a 1. What is Combinatorics? --- 2. The Pigeonhole Principle --- 3. Permutations and Combinations --- 4. Generating Permutations and Combinations --- 5. The Binomial Coefficients --- 6. The Inclusion-Exclusion Principle and Applications --- 7. Recurrence Relations and Generating Functions --- 8. Special Counting Sequences --- 9. Systems of Distinct Representatives --- 10. Combinatorial Designs --- 11. Introduction to Graph Theory --- 12. More on Graph Theory --- 13. Digraphs and Networks --- 14. P�olya Counting.
520 # $a Introductory 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 $a Combinatorial analysis $v Congresses. $3 384513
650 # 0 $a Computer science $x Mathematics. $3 181991
856 4 1 $3 Table of contents only $u http://www.loc.gov/catdir/toc/ecip0827/2008038478.html