A First Course in Discrete Mathematics

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Discrete mathematics has now established its place in most undergraduate mathematics courses. This textbook provides a concise, readable and accessible introduction to a number of topics in this area, such as enumeration, graph theory, Latin squares and designs. It is aimed at second-year undergraduate mathematics students, and provides them with many of the basic techniques, ideas and results. It contains many worked examples, and each chapter ends with a large number of exercises, with hints or solutions provided for most of them. As well as including standard topics such as binomial coefficients, recurrence, the inclusion-exclusion principle, trees, Hamiltonian and Eulerian graphs, Latin squares and finite projective planes, the text also includes material on the ménage problem, magic squares, Catalan and Stirling numbers, and tournament schedules.

Author(s): Ian Anderson
Series: Springer Undergraduate Mathematics Series
Publisher: Springer
Year: 2002

Language: English
Commentary: new scan high resolution
Pages: 200
Tags: Combinatorics; Discrete Mathematics in Computer Science

Front Matter....Pages i-viii
Counting and Binomial Coefficients....Pages 1-18
Recurrence....Pages 19-42
Introduction to Graphs....Pages 43-67
Travelling Round a Graph....Pages 69-87
Partitions and Colourings....Pages 89-105
The Inclusion-Exclusion Principle....Pages 107-119
Latin Squares and Hall’s Theorem....Pages 121-136
Schedules and 1-Factorisations....Pages 137-148
Introduction to Designs....Pages 149-177
Back Matter....Pages 179-200