Discrete mathematics : elementary and beyond /
Lovász, László, 1948-
Discrete mathematics : elementary and beyond / L. Lovász, J. Pelikán, K. Vesztergombi. - ix, 290 pages : illustrations ; 25 cm. - Undergraduate texts in mathematics . - Undergraduate texts in mathematics. .
Includes index.
Let's Count! -- Combinatorial Tools -- Binomial Coefficients and Pascal's Triangle -- Fibonacci Numbers -- Combinatorial Probability -- Integers, Divisors, and Primes -- Graphs -- Trees -- Finding the Optimum -- Matchings in Graphs -- Combinatorics in Geometry -- Euler's Formula -- Coloring Maps and Graphs -- Finite Geometries, Codes, Latin Squares, and Other Pretty Creatures -- A Glimpse of Complexity and Cryptography -- Answers to Exercises. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16.
"This book is aimed at undergraduate mathematics and computer science students interested in developing a feeling for what mathematics is all about, where mathematics can be helpful, and what kinds of questions mathematicians work on. The authors discuss a number of selected results and methods of discrete mathematics, mostly from the areas of combinatorics and graph theory, with a little number theory, probability, and combinatorial geometry. Wherever possible, the authors use proofs and problem solving to help students understand the solutions to problems. In addition, there are numerous examples, figures, and exercises spread throughout the book."--BOOK JACKET.
0387955844 9780387955841 0387955852 9780387955858
2002030585
Mathematics.
Computer science--Mathematics
QA39.3 / .L68 2003
510
Discrete mathematics : elementary and beyond / L. Lovász, J. Pelikán, K. Vesztergombi. - ix, 290 pages : illustrations ; 25 cm. - Undergraduate texts in mathematics . - Undergraduate texts in mathematics. .
Includes index.
Let's Count! -- Combinatorial Tools -- Binomial Coefficients and Pascal's Triangle -- Fibonacci Numbers -- Combinatorial Probability -- Integers, Divisors, and Primes -- Graphs -- Trees -- Finding the Optimum -- Matchings in Graphs -- Combinatorics in Geometry -- Euler's Formula -- Coloring Maps and Graphs -- Finite Geometries, Codes, Latin Squares, and Other Pretty Creatures -- A Glimpse of Complexity and Cryptography -- Answers to Exercises. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16.
"This book is aimed at undergraduate mathematics and computer science students interested in developing a feeling for what mathematics is all about, where mathematics can be helpful, and what kinds of questions mathematicians work on. The authors discuss a number of selected results and methods of discrete mathematics, mostly from the areas of combinatorics and graph theory, with a little number theory, probability, and combinatorial geometry. Wherever possible, the authors use proofs and problem solving to help students understand the solutions to problems. In addition, there are numerous examples, figures, and exercises spread throughout the book."--BOOK JACKET.
0387955844 9780387955841 0387955852 9780387955858
2002030585
Mathematics.
Computer science--Mathematics
QA39.3 / .L68 2003
510