Introduction to Combinatorics
Published on 27. September 1996
Book
Hardback
208 pages
978-0-471-15408-2 (ISBN)
Description
Combinatorics is the study of how discrete sets are arranged, counted, and constructed. This book details several general theories: the Ramsey theory, the Plya theory of counting, and the probabilistic method. It provides a basic framework in which to introduce fundamental results, discuss interconnections and problem solving techniques, and collect open problems.
More details
Series
Language
English
Place of publication
New York
United States
Target group
College/higher education
Illustrations
figures, tables
Dimensions
Height: 239 mm
Width: 168 mm
Thickness: 20 mm
Weight
454 gr
ISBN-13
978-0-471-15408-2 (9780471154082)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions
Martin J. Erickson
Introduction to Combinatorics
Book
05/2013
2nd Edition
Wiley
€97.00
Article not available at the moment
Person
MARTIN J. ERICKSON, PhD, is Associate Professor at Truman State University, Kirksville, Missouri. His research interests include combinatorics, graph theory, and coding theory. Professor Erickson has received numerous national awards and is the author of several previous publications.
Content
Preliminaries: Set Theory, Algebra, and Number Theory. EXISTENCE. The Pigeonhole Principle. Sequences and Partial Orders. Ramsey Theory. ENUMERATION. The Fundamental Counting Problem. Recurrence Relations and Explicit Formulas. Permutations and Tableaux. The Polya Theory of Counting. CONSTRUCTION. Codes. Designs. Big Designs. Bibliography. Index.