Учебное пособие. Издательство: Springer-Verlag London Berlin
Heidelberg, 2001. - 200 с.
Начальный курс дискретной математики.
Contents:
Counting and Binomial Coefficients.
Recurrence.
ntroduction to Graphs.
Travelling Round a Graph.
tions and Colourings.
The Inclusion-Exclusion Principle.
Latin Squares and Hall's Theorem.
Schedules and 1-Factorisations.
ntroduction to Designs.
Appendix.
Solutions.
Further Reading.
Bibliography.
Index.
Начальный курс дискретной математики.
Contents:
Counting and Binomial Coefficients.
Recurrence.
ntroduction to Graphs.
Travelling Round a Graph.
tions and Colourings.
The Inclusion-Exclusion Principle.
Latin Squares and Hall's Theorem.
Schedules and 1-Factorisations.
ntroduction to Designs.
Appendix.
Solutions.
Further Reading.
Bibliography.
Index.