Combinatorics

Intermediate Algebra: A Graphing Approach (Martin-Gay Hardback Series)

Elayn Martin-Gay's success as a developmental math author starts with a strong focus on mastering the basics through well-written explanations, innovative pedagogy and a meaningful, integrated program of learning resources. The revisions to this edition provide new pedagogy and resources to build reader confidence and help readers develop basic skills and understand concepts. Features incorporation of AMATYC and NCTM standards-reflected in an increased emphasis on visualization graphing, and data analysis. In addition, Martin-Gay's 4-step problem solving process-Understand, Translate, Solve and Interpret-is integrated throughout. Also includes new features such as Study Skills Reminders, "Integrated Reviews", and "Concept Checks." For those in need of a graphing utility resource in intermediate algebra, and for readers who need to prepare for advanced algebra or finite math.

Combinatorial Optimization: Algorithms and Complexity

How to Prove It: A Structured Approach

Geared to preparing students to make the transition from solving problems to proving theorems, this text teaches them the techniques needed to read and write proofs. The book begins with the basic concepts of logic and set theory, to familiarize students with the language of mathematics and how it is interpreted. These concepts are used as the basis for a step-by-step breakdown of the most important techniques used in constructing proofs. To help students construct their own proofs, this new edition contains over 200 new exercises, selected solutions, and an introduction to Proof Designer software. No background beyond standard high school mathematics is assumed. Previous Edition Hb (1994) 0-521-44116-1 Previous Edition Pb (1994) 0-521-44663-5

Beginning with the basic concepts of logic and set theory, this book teaches the language of mathematics and how it is interpreted. The author uses these concepts as the basis for a step-by-step breakdown of the most important techniques used in constructing proofs. He shows how complex proofs are built up from these smaller steps, using detailed "scratch work" sections to expose the machinery of proofs about the natural numbers, relations, functions, and infinite sets. To give students the opportunity to construct their own proofs, this new edition contains over 200 new exercises, selected solutions, and an introduction to Proof Designer software.

College Algebra: Graphs and Models with Graphing Calculator Manual Package (4th Edition) (Bittinger Graphs & Models Series)

The authors help students "see the math" through their focus on functions; visual emphasis; side-by-side algebraic and graphical solutions; real-data applications; and examples and exercises. By remaining focused on today's students and their needs, the authors lead students to mathematical understanding and, ultimately, success in class.

An Introduction to Mathematical Reasoning: Numbers, Sets and Functions

This book eases students into the rigors of university mathematics. The emphasis is on understanding and constructing proofs and writing clear mathematics. The author achieves this by exploring set theory, combinatorics, and number theory, topics that include many fundamental ideas and may not be a part of a young mathematician's toolkit. This material illustrates how familiar ideas can be formulated rigorously, provides examples demonstrating a wide range of basic methods of proof, and includes some of the all-time-great classic proofs. The book presents mathematics as a continually developing subject. Material meeting the needs of readers from a wide range of backgrounds is included. The over 250 problems include questions to interest and challenge the most able student but also plenty of routine exercises to help familiarize the reader with the basic ideas.

The purpose of this book is to introduce the basic ideas of mathematical proof to students embarking on university mathematics. The emphasis is on helping the reader in understanding and constructing proofs and writing clear mathematics. Over 250 problems include questions to interest and challenge the most able student but also plenty of routine exercises to help familiarize the reader with the basic ideas.

This book eases students into the rigors of university mathematics. The emphasis is on understanding and constructing proofs and writing clear mathematics. The author achieves this by exploring set theory, combinatorics, and number theory, topics that include many fundamental ideas and may not be a part of a young mathematician's toolkit. This material illustrates how familiar ideas can be formulated rigorously, provides examples demonstrating a wide range of basic methods of proof, and includes some of the all-time-great classic proofs. The book presents mathematics as a continually developing subject. Material meeting the needs of readers from a wide range of backgrounds is included. The over 250 problems include questions to interest and challenge the most able student but also plenty of routine exercises to help familiarize the reader with the basic ideas.

Combinatorial Lottery Systems (Wheels) with Guaranteed Wins

This is a book for players or groups of players, who want to play more than six numbers and more tickets in a well-organized, highly-balanced, and entertaining way. The strategies outlined in the book can be used in any pick-6 lottery in the world. The author has used advanced methods of combinatorics and optimization to design the most economical lottery system (wheel) for any given guarantee. Each system in his book comes with a complete table of possible wins. The lottery player will find systems with double and multiple guarantees, excellent navigational tools and presentation. It is a common belief that the lottery is a boring game and the only excitement comes from watching the draw and matching some of the winning numbers. This book shows that choosing the right way of playing your numbers, assessing the possible wins and filling the tickets can be as entertaining as a trip to Las Vegas!

Introductory Combinatorics (4th Edition)

This book emphasizes combinatorial ideas including the pigeon-hole principle, counting techniques, permutations and combinations, Pólya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, and combinatortial structures (matchings, designs, graphs). The volume provides a complete examination of combinatorial ideas and techniques. For individuals interested in combinatorial concepts.

Introduction to Graph Theory (2nd Edition)

This book fills a need for a thorough introduction to graph theory that features both the understanding and writing of proofs about graphs. Verification that algorithms work is emphasized more than their complexity. An effective use of examples, and huge number of interesting exercises, demonstrate the topics of trees and distance, matchings and factors, connectivity and paths, graph coloring, edges and cycles, and planar graphs. For those who need to learn to make coherent arguments in the fields of mathematics and computer science.

Discrete Mathematics with Graph Theory (3rd Edition)

Far more "user friendly" than the vast majority of similar books, this volume is truly written with the unsophisticated reader in mind. The pace is leisurely, but the authors are rigorous and maintain a serious attitude towards theorem proving throughout. Emphasizes "Active Reading" throughout, a skill vital to success in learning how to write proofs. Offers two sections on probability (2.4 and 2.5). Moves material on depth-first search, which previously comprised an entire (very short) chapter, to an earlier chapter where it fits more naturally. Rewrites section on RNA chains to include a new (and easier) algorithm for the recovery of an RNA chain from its complete enzyme digest. Provides true/false questions (with all answers in the back of the book) in every section. Features an appendix on matrices. A useful reference for mathematics enthusiasts who want to learn how to write proofs.

Graph Theory (Graduate Texts in Mathematics)

Graph theory is a flourishing discipline containing a body of beautiful and powerful theorems of wide applicability. Its explosive growth in recent years is mainly due to its role as an essential structure underpinning modern applied mathematics – computer science, combinatorial optimization, and operations research in particular – but also to its increasing application in the more applied sciences. The versatility of graphs makes them indispensable tools in the design and analysis of communication networks, for instance.

The primary aim of this book is to present a coherent introduction to the subject, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated, and a wealth of exercises - of varying levels of difficulty - are provided to help the reader master the techniques and reinforce their grasp of the material.

A second objective is to serve as an introduction to research in graph theory. To this end, sections on more advanced topics are included, and a number of interesting and challenging open problems are highlighted and discussed in some detail. Despite this more advanced material, the book has been organized in such a way that an introductory course on graph theory can be based on the first few sections of selected chapters.

Visit the graph theory book blog at: http://blogs.springer.com/bondyandmurty/.