Introductory Combinatorics

Introductory Combinatorics

4.25 (4 ratings by Goodreads)
By (author) 

List price: US$257.95

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks

Description

Focusing on the core material of value to students in a wide variety of fields, this book presents a broad comprehensive survey of modern combinatorics at an introductory level. The author begins with an introduction of concepts fundamental to all branches of combinatorics in the context of combinatorial enumeration. Chapter 2 is devoted to enumeration problems that involve counting the number of equivalence classes of an equivalence relation. Chapter 3 discusses somewhat less direct methods of enumeration, the principle of inclusion and exclusion and generating functions. The remainder of the book is devoted to a study of combinatorial structures.
show more

Product details

  • Hardback | 654 pages
  • 154.9 x 228.6 x 35.6mm | 997.91g
  • BROOKS/COLE
  • CA, United States
  • English
  • Revised
  • 3rd Revised edition
  • 0121108309
  • 9780121108304

Table of contents

1. AN INTRODUCTION TO ENUMERATION. Elementary Counting Principles. Functions and the Pigeonhole Principle. Subsets. Using Binomial Coefficients. Mathematical Induction. 2. EQUIVALENCE, RELATIONS, PARTITIONS, AND MULTISETS. Equivalence Relations. Distributions and Multisets. Partitions and Stirling Numbers. Partitions of Integers. 3. ALGEBRAIC COUNTING TECHNIQUES. The Principle of Inclusion and Exclusion. The Concept of a Generating Function. Applications to Partitions and Inclusion--Exclusion. Recurrence Relations and Generating Functions. Exponential Generating Functions. 4. GRAPH THEORY. Eulerian Walks and the Idea of Graphs. Trees. Shortest Paths and Search Trees. Isomorphism and Planarity. Digraphs. Coloring. Graphs and Matrices. 5. MATCHING AND OPTIMIZATION. Matching Theory. The Greedy Algorithm. Network Flows. Flows, Connectivity, and Matching. 6. COMBINATORIAL DESIGNS. Latin Squares and Graeco-Latin Squares. Block Designs. Construction and Resolvability of Designs. Affine and Projective Planes. Codes and Designs. 7. ORDERED SETS. Partial Orderings. Linear Extensions and Chains. Lattices. Boolean Algebras. Mobius Functions. Products of Orderings. 8. ENUMERATION UNDER GROUP ACTION. Permutation Groups. Groups Acting on Sets. Polya's Enumeration Theorem.
show more

Rating details

4 ratings
4.25 out of 5 stars
5 25% (1)
4 75% (3)
3 0% (0)
2 0% (0)
1 0% (0)
Book ratings by Goodreads
Goodreads is the world's largest site for readers with over 50 million reviews. We're featuring millions of their reader ratings on our book pages to help you find your new favourite book. Close X