Introduction to combinatorics
Author(s)
Bibliographic Information
Introduction to combinatorics
(Wiley-Interscience series in discrete mathematics and optimization)
Wiley, c1996
- : hard
Available at 29 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
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"