ShopSpell

A First Course in Discrete Mathematics [Paperback]

$31.99     $37.99    16% Off      (Free Shipping)
100 available
  • Category: Books (Mathematics)
  • Author:  Anderson, Ian
  • Author:  Anderson, Ian
  • ISBN-10:  1852332360
  • ISBN-10:  1852332360
  • ISBN-13:  9781852332365
  • ISBN-13:  9781852332365
  • Publisher:  Springer
  • Publisher:  Springer
  • Pages:  200
  • Pages:  200
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-Feb-2000
  • Pub Date:  01-Feb-2000
  • SKU:  1852332360-11-SPRI
  • SKU:  1852332360-11-SPRI
  • Item ID: 101484135
  • List Price: $37.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 5 business days
  • Delivery by: Jul 05 to Jul 07
  • Notes: Brand New Book. Order Now.
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.Discrete mathematics has now established its place in most undergraduatemathematics courses. This textbook provides a concise, readable andaccessible introduction to a number of topics in this area, such asenumeration, graph theory, Latin squares and designs. It is aimed atsecond-year undergraduate mathematics students, and provides them withmany of the basic techniques, ideas and results. It contains many workedexamples, and each chapter ends with a large number of exercises, withhints or solutions provided for most of them.As well as including standard topics such as binomial coefficients,recurrence, the inclusion-exclusion principle, trees, Hamiltonian andEulerian graphs, Latin squares and finite projective planes, the text alsoincludes material on the m?nage problem, magic squares, Catalan andStirling numbers, and tournament schedules.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 Halls Theorem.- 8. Schedules and 1-Factorisations.- 9. Introduction to Designs.- Solutions.- Ful“'
Add Review