Combinatorics is mathematics of enumeration, existence, construction, and optimization questions concerning finite sets. This text focuses on the first three types of questions and covers basic counting and existence principles, distributions, generating functions, recurrence relations, Pólya theory, combinatorial designs, error correcting codes, partially ordered sets, and selected applications to graph theory including the enumeration of trees, the chromatic polynomial, and introductory Ramsey theory. The only prerequisites are single-variable calculus and familiarity with sets and basic proof techniques. The text emphasizes the brands of thinking that are characteristic of combinatorics: bijective and combinatorial proofs, recursive analysis, and counting problem classification. It is flexible enough to be used for undergraduate courses in combinatorics, second courses in discrete mathematics, introductory graduate courses in applied mathematics programs, as well as for independent study or reading courses. What makes this text a guided tour are the approximately 350 reading questions spread throughout its eight chapters. These questions provide checkpoints for learning and prepare the reader for the end-of-section exercises of which there are over 470. Most sections conclude with Travel Notes that add color to the material of the section via anecdotes, open problems, suggestions for further reading, and biographical information about mathematicians involved in the discoveries.
Combinatorics is a subject of increasing importance, owing to its links with computer science, statistics and algebra. This is a textbook aimed at second-year undergraduates to beginning graduates.
ABOUT THE SERIES: The Very Short Introductions series from Oxford University Press contains hundreds of titles in almost every subject area. These pocket-sized books are the perfect way to get ahead in a new subject quickly.
J. Math . 14 , 614-625 . R. L. McFarland ( 1973 ) , A family of difference sets in non - cyclic groups , J. Combinatorial Theory ( A ) 15 , 1-10 . J. Singer ( 1938 ) , A theorem in finite projective geometry and some applications to ...
Anyone with an interest in mathematics, professional or recreational, will be sure to find this book both enlightening and enjoyable.
Most recently , a number of helpful ideas were contributed by my students Sue O. Hart , Paul Kaschube , and Mark Mummy . Sue Hart , in particular , read the entire manuscript and found and corrected numerous errors .
This book is also ideal for readers who wish to better understand the various applications of elementary combinatorics.
Providing a self-contained resource for upper undergraduate courses in combinatorics, this text emphasizes computation, problem solving, and proof technique.
WINNER of a CHOICE Outstanding Academic Title Award for 2006!
The general version of this problem (with n players) is due to Todd Ebert, who proposed it in his Ph.D. thesis at the University of California at Santa Barbara in 1998. 5.17 Prove that the probability that the determinant of a random n ...
... Richard A. Mollin An Atlas of The Smaller Maps in Orientable and Nonorientable Surfaces , David M. Jackson and Terry I. Visentin An Introduction to Crytography , Richard A. Mollin Combinatorial Algorithms : Generation Enumeration ...