A first course in discrete mathematics
著者
書誌事項
A first course in discrete mathematics
（Springer undergraduate mathematics series）
Springer, c2001
- : pbk
大学図書館所蔵 件 / 全26件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 197-198) and index
内容説明・目次
内容説明
Drawing on many years'experience of teaching discrete mathem atics to students of all levels, Anderson introduces such as pects as enumeration, graph theory and configurations or arr angements. Starting with an introduction to counting and rel ated problems, he moves on to the basic ideas of graph theor y with particular emphasis on trees and planar graphs. He de scribes the inclusion-exclusion principle followed by partit ions of sets which in turn leads to a study of Stirling and Bell numbers. Then follows a treatment of Hamiltonian cycles, Eulerian circuits in graphs, and Latin squares as well as proof of Hall's theorem. He concludes with the constructions of schedules and a brief introduction to block designs. Each chapter is backed by a number of examples, with straightforw ard applications of ideas and more challenging problems.
目次
1. Counting and Binomial Coefficients.- 2. Recurrence.- 3. Introduction to Graphs.- 4. Travelling Round a Graph.- 5. Partitions and Colourings.- 6. The Inclusion Exclusion Principle.- 7. Latin Squares and Hall's Theorem.- 8. Schedules and 1-Factorisations.- 9. Introduction to Designs.- Solutions.- Further Reading.
「Nielsen BookData」 より