A Primer in Combinatorics

Front Cover
Walter de Gruyter, Jul 30, 2010 - Mathematics - 333 pages
0 Reviews

This textbook is devoted to Combinatorics and Graph Theory, which are cornerstones of Discrete Mathematics. Every section begins with simple model problems. Following their detailed analysis, the reader is led through the derivation of definitions, concepts and methods for solving typical problems. Theorems then are formulated, proved and illustrated by more problems of increasing difficulty. Topics covered include elementary combinatorial constructions, application to probability theory, introduction to graphs and trees with application to hierarchical clustering algorithms, more advanced counting techniques, and existence theorems in combinatorial analysis.

The text systematically employs the basic language of set theory. This approach is often useful for solving combinatorial problems, especially problems where one has to identify some objects, and significantly reduces the number of the students’ errors; it is demonstrated in the text on many examples.

The textbook is suitable for undergraduate and entry-level graduate students of mathematics and computer science, lecturers in these fields, and anyone studying combinatorial methods and graphical models for solving various problems. The book contains more than 700 problems and can be used as a reading and problem book for an independent study seminar or self-education.

 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Chapter 1 Basic Counting
3
Chapter 2 Basic Graph Theory
92
Chapter 3 Hierarchical Clustering and Graphs
129
Chapter 4 Enumerative Combinatorics
177
Chapter 5 Existence Theorems in Combinatorics
262
Backmatter
307
Copyright

Other editions - View all

Common terms and phrases

About the author (2010)

Alexander Kheyfits, City University of New York, USA.

Bibliographic information