Combinatorics Topics, Techniques, Algorithms

ISBN-10: 0521457610

ISBN-13: 9780521457613

Edition: 1994

Authors: Peter J. Cameron
List price: $89.99 Buy it from $84.21
This item qualifies for FREE shipping

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description: Combinatorics is a subject of increasing importance because of its links with computer science, statistics, and algebra. This textbook stresses common techniques (such as generating functions and recursive construction) that underlie the great variety of subject matter, and the fact that a constructive or algorithmic proof is more valuable than an existence proof. The author emphasizes techniques as well as topics and includes many algorithms described in simple terms. The text should provide essential background for students in all parts of discrete mathematics.

New Starting from $97.69
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Periodic Table Online content $4.95 $1.99
Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
Business Ethics Online content $4.95 $1.99
Add to cart
Study Briefs
Business Law Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $89.99
Copyright year: 1994
Publisher: Cambridge University Press
Publication date: 10/6/1994
Binding: Paperback
Pages: 368
Size: 7.00" wide x 10.00" long x 1.00" tall
Weight: 1.386
Language: English

Preface
What is Combinatorics?
Sample problems
How to use this book
What you need to know
Exercises
On numbers and counting
Natural numbers and arithmetic
Induction
Some useful functions
Orders of magnitude
Different ways of counting
Double counting
Appendix on set notation
Exercises
Subsets, partitions, permutations
Subsets
Subsets of fixed size
The Binomial Theorem and Pascal's Triangle
Project: Congruences of binomial coefficients
Permutations
Estimates for factorials
Selections
Equivalence and order
Project: Finite topologies
Project: Cayley's Theorem on trees
Bell numbers
Generating combinatorial objects
Exercises
Recurrence relations and generating functions
Fibonacci numbers
Aside on formal power series
Linear recurrence relations with constant coefficients
Derangements and involutions
Catalan and Bell numbers
Computing solutions to recurrence relations
Project: Finite fields and QUICKSORT
Exercises
The Principle of Inclusion and Exclusion
PIE
A generalisation
Stirling numbers
Project: Stirling numbers and exponentials
Even and odd permutations
Exercises
Latin squares and SDRs
Latin squares
Systems of distinct representatives
How many Latin squares?
Quasigroups
Project: Quasigroups and groups
Orthogonal Latin squares
Exercises
Extremal set theory
Intersecting families
Sperner families
The De Bruijn-Erdos Theorem
Project: Regular families
Exercises
Steiner triple systems
Steiner systems
A direct construction
A recursive construction
Packing and covering
Project: Some special Steiner triple systems
Project: Tournaments and Kirkman's schoolgirls
Exercises
Finite geometry
Linear algebra over finite fields
Gaussian coefficients
Projective geometry
Axioms for projective geometry
Projective planes
Other kinds of geometry
Project: Coordinates and configurations
Project: Proof of the Bruck-Ryser Theorem
Finite fields
Exercises
Ramsey's Theorem
The Pigeonhole Principle
Some special cases
Ramsey's Theorem
Bounds for Ramsey numbers
Applications
The infinite version
Exercises
Graphs
Definitions
Trees and forests
Minimal spanning trees
Eulerian graphs
Hamiltonian graphs
Project: Gray codes
The Travelling Salesman
Digraphs
Networks
Menger, Konig and Hall
Diameter and girth
Project: Moore graphs
Exercises
Posets, lattices and matroids
Posets and lattices
Linear extensions of a poset
Distributive lattices
Aside on propositional logic
Chains and antichains
Products and dimension
The Mobius function of a poset
Matroids
Project: Arrow's Theorem
Exercises
More on partitions and permutations
Partitions, diagrams and conjugacy classes
Euler's Pentagonal Numbers Theorem
Project: Jacobi's Identity
Tableaux
Symmetric polynomials
Exercises
Automorphism groups and permutation groups
Three definitions of a group
Examples of groups
Orbits and transitivity
The Schreier-Sims algorithm
Primitivity and multiple transitivity
Examples
Project: Cayley digraphs and Frucht's Theorem
Exercises
Enumeration under group action
The Orbit-counting Lemma
An application
Cycle index
Examples
Direct and wreath products
Stirling numbers revisited
Project: Cycle index and symmetric functions
Exercises
Designs
Definitions and examples
To repeat or not to repeat
Fisher's Inequality
Designs from finite geometry
Small designs
Project: Hadamard matrices
Exercises
Error-correcting codes
Finding out a liar
Definitions
Probabilistic considerations
Some bounds
Linear codes; Hamming codes
Perfect codes
Linear codes and projective spaces
Exercises
Graph colourings
More on bipartite graphs
Vertex colourings
Project: Brooks' Theorem
Perfect graphs
Edge colourings
Topological graph theory
Project: The Five-colour Theorem
Exercises
The infinite
Counting infinite sets
Konig's Infinity Lemma
Posets and Zorn's Lemma
Ramsey theory
Systems of distinct representatives
Free constructions
The random graph
Exercises
Where to from here?
Computational complexity
Some graph-theoretic topics
Computer software
Unsolved problems
Further reading
Answers to selected exercises
Bibliography
Index
×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×