|Listed in category:
Have one to sell?

Introductory Combinatorics (5th - Hardcover, by Brualdi Richard A.

US $24.99
ApproximatelyRM 105.73
Condition:
Acceptable
Name on the edges. Worn corners. Water stains on the last dozens of pages.
Shipping:
Free USPS Media MailTM.
Located in: Cary, North Carolina, United States
Delivery:
Estimated between Sat, 2 Aug and Fri, 8 Aug to 94104
Delivery time is estimated using our proprietary method which is based on the buyer's proximity to the item location, the shipping service selected, the seller's shipping history, and other factors. Delivery times may vary, especially during peak periods.
Returns:
No returns accepted.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller assumes all responsibility for this listing.
eBay item number:256995817033

Item specifics

Condition
Acceptable
A book with obvious wear. May have some damage to the cover but integrity still intact. The binding may be slightly damaged but integrity is still intact. Possible writing in margins, possible underlining and highlighting of text, but no missing pages or anything that would compromise the legibility or understanding of the text. See all condition definitionsopens in a new window or tab
Seller Notes
“Name on the edges. Worn corners. Water stains on the last dozens of pages.”
Book Title
Introductory Combinatorics (5th Edition)
ISBN
9780136020400

About this product

Product Identifiers

Publisher
Prentice Hall PTR
ISBN-10
0136020402
ISBN-13
9780136020400
eBay Product ID (ePID)
5992309

Product Key Features

Number of Pages
648 Pages
Language
English
Publication Name
Introductory Combinatorics
Subject
General, Combinatorics
Publication Year
2008
Type
Textbook
Author
Richard A. Brualdi
Subject Area
Mathematics
Format
Hardcover

Dimensions

Item Height
1.5 in
Item Weight
41.6 Oz
Item Length
9.4 in
Item Width
7.2 in

Additional Product Features

Edition Number
5
Intended Audience
College Audience
LCCN
2008-038478
Dewey Edition
23
Dewey Decimal
511/.6
Table Of Content
1. What is Combinatorics? 1.1 Example: Perfect Covers of Chessboards 1.2 Example: Magic Squares 1.3 Example: The Four-Color Problem 1.4 Example: The Problem of the 36 Officers 1.5 Example: Shortest-Route Problem 1.6 Example: Mutually Overlapping Circles 1.7 Example: The Game of Nim 2. The Pigeonhole Principle 2.1 Pigeonhole Principle: Simple Form 2.2 Pigeonhole Principle: Strong Form 2.3 A Theorem of Ramsay 3. Permutations and Combinations 3.1 Four Basic Counting Principles 3.2 Permutations of Sets 3.3 Combinations of Sets 3.4 Permutations of Multisets 3.5 Combinations of Multisets 3.6 Finite Probability 4. Generating Permutations and Combinations 4.1 Generating Permutations 4.2 Inversions in Permutations 4.3 Generating Combinations 4.4 Generating r-Combinations 4.5 Partial Orders and Equivalence Relations 5. The Binomial Coefficients 5.1 Pascal's Formula 5.2 The Binomial Theorem 5.3 Unimodality of Binomial Coefficients 5.4 The Multinomial Theorem 5.5 Newton's Binomial Theorem 5.6 More on Partially Ordered Sets 6. The Inclusion-Exclusion Principle and Applications 6.1 The Inclusion-Exclusion Principle 6.2 Combinations with Repetition 6.3 Derangements 6.4 Permutations with Forbidden Positions 6.5 Another Forbidden Position Problem 6.6 Möbius Inversion 7. Recurrence Relations and Generating Functions 7.1 Some Number Sequences 7.2 Generating Functions 7.3 Exponential Generating Functions 7.4 Solving Linear Homogeneous Recurrence Relations 7.5 Nonhomogeneous Recurrence Relations 7.6 A Geometry Example 8. Special Counting Sequences 8.1 Catalan Numbers 8.2 Difference Sequences and Stirling Numbers 8.3 Partition Numbers 8.4 A Geometric Problem 8.5 Lattice Paths and Schröder Numbers 9. Systems of Distinct Representatives 9.1 General Problem Formulation 9.2 Existence of SDRs 9.3 Stable Marriages 10. Combinatorial Designs 10.1 Modular Arithmetic 10.2 Block Designs 10.3 Steiner Triple Systems 10.4 Latin Squares 11. Introduction to Graph Theory 11.1 Basic Properties 11.2 Eulerian Trails 11.3 Hamilton Paths and Cycles 11.4 Bipartite Multigraphs 11.5 Trees 11.6 The Shannon Switching Game 11.7 More on Trees 12. More on Graph Theory 12.1 Chromatic Number 12.2 Plane and Planar Graphs 12.3 A 5-color Theorem 12.4 Independence Number and Clique Number 12.5 Matching Number 12.6 Connectivity 13. Digraphs and Networks 13.1 Digraphs 13.2 Networks 13.3 Matching in Bipartite Graphs Revisited 14. Pòlya Counting 14.1 Permutation and Symmetry Groups 14.2 Burnside's Theorem 14.3 Pòlya's Counting formula
Synopsis
Appropriate for one- or two-semester, junior- to senior-level combinatorics courses. This trusted best-seller covers the key combinatorial ideas-including the pigeon-hole principle, counting techniques, permutations and combinations, Plya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, combinatortial structures (matchings, designs, graphs), and flows in networks. The Fifth Edition incorporates feedback from users to the exposition throughout and adds a wealth of new exercises., Appropriate for one- or two-semester, junior- to senior-level combinatorics courses. This trusted best-seller covers the key combinatorial ideas including the pigeon-hole principle, counting techniques, permutations and combinations, Polya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, combinatortial structures (matchings, designs, graphs), and flows in networks. The Fifth Edition incorporates feedback from users to the exposition throughout and adds a wealth of new exercises. ", Appropriate for one- or two-semester, junior- to senior-level combinatorics courses. This trusted best-seller covers the key combinatorial ideas-including the pigeon-hole principle, counting techniques, permutations and combinations, Pólya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, combinatortial structures (matchings, designs, graphs), and flows in networks. The Fifth Edition incorporates feedback from users to the exposition throughout and adds a wealth of new exercises.
LC Classification Number
QA164.B76 2008

Item description from the seller

About this seller

Mediabee2000

99% positive feedback32K items sold

Joined Mar 2003

Detailed Seller Ratings

Average for the last 12 months
Accurate description
4.9
Reasonable shipping cost
4.8
Shipping speed
5.0
Communication
4.9

Seller feedback (6,341)

All ratings
Positive
Neutral
Negative