Jonathan L. Gross

November 16, 2007
by Chapman and Hall/CRC

Textbook
- 664 Pages
- 287 B/W Illustrations

ISBN 9781584887430 - CAT# C7435

Series: Discrete Mathematics and Its Applications

**For Instructors** Request an e-inspection copy

**For Librarians** Available on CRCnetBASE >>

was $121.95

USD^{$}97^{.56}

SAVE *~*$24.39

Add to Cart

Add to Wish List

FREE Standard Shipping!

After an introduction to combinatorics, the book explores six systematic approaches within a comprehensive framework: sequences, solving recurrences, evaluating summation expressions, binomial coefficients, partitions and permutations, and integer methods. The author then focuses on graph theory, covering topics such as trees, isomorphism, automorphism, planarity, coloring, and network flows. The final chapters discuss automorphism groups in algebraic counting methods and describe combinatorial designs, including Latin squares, block designs, projective planes, and affine planes. In addition, the appendix supplies background material on relations, functions, algebraic systems, finite fields, and vector spaces.

Paving the way for students to understand and perform combinatorial calculations, this accessible text presents the discrete methods necessary for applications to algorithmic analysis, performance evaluation, and statistics as well as for the solution of combinatorial problems in engineering and the social sciences.

We provide complimentary e-inspection copies of primary textbooks to instructors considering our books for course adoption.

Request an

e-inspection copy

e-inspection copy