Walk Through Combinatorics, A: An Introduction to Enumeration and Graph Theory - Couverture rigide

Bona, Miklos

Couverture rigide

ISBN 10 : 9810249004 ISBN 13 : 9789810249007

Editeur : World Scientific Publishing Co Pte Ltd, 2002

Synopsis

This is a textbook for an introductory combinatorics course that can take up one or two semesters. An extensive list of exercises, ranging in difficulty from "routine" to "worthy of independent publication", is included. In each section, there are also exercises that contain material not explicitly discussed in the text before, so as to provide instructors with extra choices if they want to shift the emphasis of their course.It goes without saying that the text covers the classic areas, i.e. combinatorial choice problems and graph theory. What is unusual, for an undergraduate textbook, is that the author has included a number of more elaborate concepts, such as Ramsey theory, the probabilistic method and -- probably the first of its kind -- pattern avoidance. While the reader can only skim the surface of these areas, the author believes that they are interesting enough to catch the attention of some students. As the goal of the book is to encourage students to learn more combinatorics, every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading.

A propos du livre

Présentation de l'éditeur

This is a textbook for an introductory combinatorics course that can take up one or two semesters. An extensive list of problems, ranging from routine exercises to research questions, is included. In each section, there are also exercises that contain material not explicitly discussed in the preceding text, so as to provide instructors with extra choices if they want to shift the emphasis of their course. Just as with the first edition, the new edition walks the reader through the classic parts of combinatorial enumeration and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques, and on the other hand, showing that some questions at the forefront of research are comprehensible and accessible for the talented and hard-working undergraduate. The basic topics discussed are: the twelvefold way, cycles in permutations, the formula of inclusion and exclusion, the notion of graphs and trees, matchings and Eulerian and Hamiltonian cycles. The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, and algorithms and complexity.As the goal of the book is to encourage students to learn more combinatorics, every effort has been made to provide them with a not only useful, but also enjoyable and engaging reading.

Biographie de l'auteur

Miklos Bona received his PhD at Massachusetts Institute of Technology. He is a Professor of Mathematics at the University of Florida, where he has been inducted into the Academy of Distinguished Teaching Scholars. His research has been supported by the National Science Foundation, the National Security Agency, and the Howard Hughes Medical Institute. Miklos Bona has received teaching awards at the University of Florida and at the University of Pennsylvania. He is one of the Editor-in-Chiefs of the Electronic Journal of Combinatorics.

Détails de l'édition

• Éditeur: World Scientific Publishing Co Pte Ltd
• Date d'édition: 2002
• Langue: anglais
• ISBN 10: 9810249004
• ISBN 13: 9789810249007
• Reliure: Relié
• Nombre de pages: 424
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible