WALK THROUGH COMBINATORICS (5ED)

The first half of the book walks the reader through methods of counting, both direct elementary methods and the more advanced method of generating functions. Then, in the second half of the book, the reader learns how to apply these methods to fascinating objects, such as graphs, designs, random variables, partially ordered sets, and algorithms. In short, the first half emphasizes depth by discussing counting methods at length; the second half aims for breadth, by showing how numerous the applications of our methods are. New to this fifth edition of A Walk Through Combinatorics is the addition of Instant Check exercises — more than a hundred in total — which are located at the end of most subsections. As was the case for all previous editions, the exercises sometimes contain new material that was not discussed in the text, allowing instructors to spend more time on a given topic if they wish to do so. With a thorough introduction into enumeration and graph theory, as well as a chapter on permutation patterns (not often covered in other textbooks), this book is well suited for any undergraduate introductory combinatorics class. Contents: Foreword Preface Acknowledgments Basic Methods: Seven is More Than Six. The Pigeon-Hole Principle One Step at a Time. The Method of Mathematical Induction Enumerative Combinatorics: There are a Lot of Them. Elementary Counting Problems No Matter How You Slice It. The Binomial Theorem and Related Identities Divide and Conquer. Partitions Not So Vicious Cycles. Cycles in Permutations You Shall Not Overcount. The Sieve A Function is Worth Many Numbers. Generating Functions Graph Theory: Dots and Lines. The Origins of Graph Theory Staying Connected. Trees Finding a Good Match. Coloring and Matching Do Not Cross. Planar Graphs Horizons: Does It Clique? Ramsey Theory So Hard to Avoid. Subsequence Conditions on Permutations Who Knows What It Looks Like, But It Exists. The Probabilistic Method At Least Some Order. Partial Orders and Lattices As Evenly as Possible. Block Designs and Error Correcting Codes Are They Really Different? Counting Unlabeled Structures The Sooner the Better. Combinatorial Algorithms Does Many Mean More Than One? Computational Complexity Bibliography Index Readership: This book is primarily suitable for advanced undergraduate students and instructors teaching an introductory combinatorics class. However, it would also be applicable to graduate students in fields other than combinatorics who need an introduction to Combinatorics. Review of the 4th Edition:'This is still one of the best introductions to combinatorics.' - Mathematical Association of America Review of the 3rd Edition:'The chapters on block designs and counting unlabeled structures have been added to the third edition, and there are also one hundred new problems in the other eighteen chapters. When I next teach a combinatorics course, this will be the text I use.' - Mathematical Reviews Reviews of the 2nd Edition:'Bóna's book is an excellent choice for anyone who wants an introduction to this beautiful branch of mathematics … Plentiful examples illustrate each of the topics included in the book. Bóna does a supreme job of walking us through combinatorics.' - CHOICE 'This book covers all of the basic results one would expect and a selection of advanced topics as well. There are many very good problems in it. The problems in this book are, as the kids say, awesome. This is a comprehensive book on combinatorics. Exposition is clear, coverage is massive, and the problems are plentiful and excellent.' - SIGACT NEWS Key Features: Includes a controlled access solutions manual as a resource for instructors who adopt the textbook The book contains a broad selection of other topics where the methods learned in the first part are applied The book contains a chapter on permutation patterns. This is not so in other introductory textbooks The goal of the author has been not simply that the reader learns about combinatorics, but...