WALK THROUGH COMBINATORICS, A: AN INTRODUCTION TO ENUMERATION AND GRAPH THEORY 3E

Bona, Miklos

ISBN 10: 9814335231 / ISBN 13: 9789814335232

Editore: World Scientific Publishing Company, 2011

Riguardo questo articolo

This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Codice articolo ABNR-196426

Dati bibliografici

• Titolo: WALK THROUGH COMBINATORICS, A: AN INTRODUCTION TO ENUMERATION AND GRAPH THEORY 3E
• Editore: World Scientific Publishing Company
• Data di pubblicazione: 2011
• Lingua: Inglese
• ISBN 10: 9814335231
• ISBN 13: 9789814335232
• Rilegatura: Rilegato
• Edizione: terza edizione
• Condizione: New

Descrizione articolo

Riassunto

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.

Informazioni sull?autore

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.