A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory - Softcover

Bona, Miklos

Softcover

ISBN 10: 9810249012 ISBN 13: 9789810249014

Verlag: World Scientific Publishing Co Pte Ltd, 2002

Inhaltsangabe

This is a textbook for an introductory combinatorics course lasting 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 two editions, 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 to the talented and hardworking 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, Eulerian and Hamiltonian cycles, and planar graphs.The selected advanced topics are: Ramsey theory, pattern avoidance, the probabilistic method, partially ordered sets, the theory of designs (new to this edition), enumeration under group action (new to this edition), generating functions of labeled and unlabeled structures 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.

Details zur Ausgabe

• Verlag: World Scientific Publishing Co Pte Ltd
• Erscheinungsdatum: 2002
• Sprache: Englisch
• ISBN 10: 9810249012
• ISBN 13: 9789810249014
• Einband: Taschenbuch
• Anzahl der Seiten: 242
• Kontakt zum Hersteller: Nicht verfügbar
• Verantwortliche Person: Nicht verfügbar