Updated with new material, this"Fifth Edition" of the most widely used book in combinatorial problems explains how to reason and model combinatorically. It also stresses the systematic analysis of different possibilities, exploration of the logical structure of a problem, and ingenuity. Combinatorical reasoning underlies all analysis of computer systems. It plays a similar role in discrete operations research problems and in finite probability. This bookseeks to develop proficiency in basic discrete math problem solving in the way that a calculus text develops proficiency in basic analysis problem solving.
What people are saying - Write a review
We haven't found any reviews in the usual places.
One Elements of Graph Theory
Two Covering Circuits and Graph Coloring
Three Trees and Searching
11 other sections not shown
Other editions - View all
3-colored a-z cut a-z flow adjacent balls biconnected components binary sequences binomial binomial coefficients bipartite graph coefficient color column combinatorial corners counting problems cube darkened squares digits directed graph distinct objects distribute edge cover equation equivalent Euler circuit Example EXERCISES SUMMARY exponential generating function Ferrers diagram Find a recurrence finite-state machine formula four graph coloring graph G graph in Figure graph theory Grundy number Hamilton circuit identical induction integer integer solutions isomorphic kernel labeled least letters matching mathematical matrix maximal flow minimal n-digit n-set number of different obtain outcomes pair partitions pattern inventory permutation pick pile planar graph player polynomial position possible Prim's algorithm probability proof Prove recurrence relation regular grammar secret code Section shortest path Show shown in Figure solve spanning tree subset SUMMARY OF EXERCISES Suppose symmetries Theorem tion tour undirected values vertex vertices of degree