Introduction to combinatorics

Bibliographic Information

Introduction to combinatorics

Martin J. Erickson

(Wiley-Interscience series in discrete mathematics and optimization)

Wiley, c1996

  • : hard

Available at  / 29 libraries

Search this Book/Journal

Note

"A Wiley-Interscience publication."

Includes bibliographical references (p. 187-189) and index

Description and Table of Contents

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.

Table of Contents

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.

by "Nielsen BookData"

Details

  • NCID
    BA30463340
  • ISBN
    • 0471154083
  • LCCN
    96028174
  • Country Code
    us
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    New York
  • Pages/Volumes
    xii, 195 p.
  • Size
    25 cm
  • Classification
  • Subject Headings
  • Parent Bibliography ID
Page Top