This book takes the reader on a mathematical journey, from a number-theoretic point of view, to the realm of Markov’s theorem and the uniqueness conjecture, gradually unfolding many beautiful connections until everything falls into place in the proof of Markov’s theorem. What makes the Markov theme so attractive is that it appears in an astounding variety of different fields, from number theory to combinatorics, from classical groups and geometry to the world of graphs and words. On the way, there are also introductory forays into some fascinating topics that do not belong to the standard curriculum, such as Farey fractions, modular and free groups, hyperbolic planes, and algebraic words. The book closes with a discussion of the current state of knowledge about the uniqueness conjecture, which remains an open challenge to this day. All the material should be accessible to upper-level undergraduates with some background in number theory, and anything beyond this level is fully explained in the text. This is not a monograph in the usual sense concentrating on a specific topic. Instead, it narrates in five parts – Numbers, Trees, Groups, Words, Finale – the story of a discovery in one field and its many manifestations in others, as a tribute to a great mathematical achievement and as an intellectual pleasure, contemplating the marvellous unity of all mathematics.

This book surveys matching theory, with an emphasis on connections with other areas of mathematics and on the role matching theory has played, and continues to play, in the development of some of these areas. Besides basic results on the existence of matchings and on the matching structure of graphs, the impact of matching theory is discussed by providing crucial special cases and nontrivial examples on matroid theory, algorithms, and polyhedral combinatorics. The new Appendix outlines how the theory and applications of matching theory have continued to develop since the book was first published in 1986, by launching (among other things) the Markov Chain Monte Carlo method.

Note: This is a custom edition of Levin's full Discrete Mathematics text, arranged specifically for use in a discrete math course for future elementary and middle school teachers. (It is NOT a new and updated edition of the main text.)This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach. The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in discrete math and as the "introduction to proof" course for math majors. The course is usually taught with a large amount of student inquiry, and this text is written to help facilitate this.Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs.While there are many fine discrete math textbooks available, this text has the following advantages: - It is written to be used in an inquiry rich course.- It is written to be used in a course for future math teachers.- It is open source, with low cost print editions and free electronic editions.

These notes were first used in an introductory course team taught by the authors at Appalachian State University to advanced undergraduates and beginning graduates. The text was written with four pedagogical goals in mind: offer a variety of topics in one course, get to the main themes and tools as efficiently as possible, show the relationships between the different topics, and include recent results to convince students that mathematics is a living discipline.

From the reviews: "About 30 years ago, when I was a student, the first book on combinatorial optimization came out referred to as "the Lawler" simply. I think that now, with this volume Springer has landed a coup: "The Schrijver". The box is offered for less than 90.- EURO, which to my opinion is one of the best deals after the introduction of this currency." OR-Spectrum