Recomendar este libro

Imprimir ficha del artículo

Comentarios (0)

Contenido

Drawing on many years' experience of teaching discrete mathematics to students of all levels, the author introduces the various aspects of discrete mathematics including enumeration, graph theory and configurations or arrangements. Starting off with an introduction to counting and counting problems, the text proceeds to introduce the basic ideas of graph theory with particular emphasis on trees and planar graphs. The inclusion-exclusion principle is described and followed by a chapter on partitions of sets which leads to a study of Stirling and Bell numbers. Hamiltonian cycles and Eulerian circuits in graphs are described, Latin squares are defined and Hall's theorem is proved. The book concludes with chapters on the constructions of schedules and a brief introduction to block designs. Each chapter is supported by a number of examples, with straightforward applications of ideas alongside more challenging problems.

   INDICE: Counting and Binomial Coefficients.- Recurrence.- Introduction to Graphs.- Travelling Round a Graph.- Partitions and Colourings.- The Inclusion-Exclusion Principle.- Latin Squares and Hall's Theorem.- Schedules and One-Factorisations.- Introduction to Designs.- Appendix.- Solutions.- Further Reading.- Bibliography.

Detalles del artículo

• Páginas : 210
• Editorial : Springer Verlag Gmbh & Co. Kg
• Idioma : Inglés
• Fecha de Publicación : 01/01/2001
• ISBN: 9781852332365
• Serie: Springer undergraduate mathematics
• Encuadernación : Rústica
• Nº Volúmenes : 1
• País de Publicación : Reino Unido (INGLATERRA)