Discrete mathematics : elementary and beyond / L. Lovász, J. Pelikán, K. Vesztergombi.

By: Lovász, László, 1948-Contributor(s): Pelikán, J. (József) | Vsztergombi, K. (Katalin)Material type: TextTextSeries: Undergraduate texts in mathematicsPublication details: New York : Springer, c2003Description: ix, 290 p. : ill. ; 25 cmISBN: 0387955844 (acidfree paper); 9780387955841 (acidfree paper); 0387955852 (pbk. : acidfree paper); 9780387955858 (pbk. : acidfree paper)Subject(s): Mathematics | Computer science -- MathematicsLOC classification: QA39.3 | .L68 2003Online resources: Click here to access online
Contents:
1. Let's count -- 2. Combinatorial tools -- 3. Binomial coefficients and Pascal's triangle -- 4. Fibonacci numbers -- 5. Combinatorial probability -- 6. Integers, divisors, and primes -- 7. Graphs -- 8. Trees -- 9. Finding the optimum -- 10. Matchings in graphs -- 11. Combinatorics in geometry -- 12. Euler's formula -- 13. Coloring maps and graphs -- 14. Finite geometries, codes, Latin squares, and other pretty creatures -- 15. A glimpse of complexity and cryptography -- 16. Answers to exercises.
Review: "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."--Jacket.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current library Collection Call number Status Date due Barcode
e-Books e-Books Main Library -University of Zimbabwe
Click on Online resources to access the e-Book QA39.3 .L68 2003 (Browse shelf (Opens below)) Available

Includes index.

Includes bibliographical references and index.

1. Let's count -- 2. Combinatorial tools -- 3. Binomial coefficients and Pascal's triangle -- 4. Fibonacci numbers -- 5. Combinatorial probability -- 6. Integers, divisors, and primes -- 7. Graphs -- 8. Trees -- 9. Finding the optimum -- 10. Matchings in graphs -- 11. Combinatorics in geometry -- 12. Euler's formula -- 13. Coloring maps and graphs -- 14. Finite geometries, codes, Latin squares, and other pretty creatures -- 15. A glimpse of complexity and cryptography -- 16. Answers to exercises.

"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."--Jacket.

There are no comments on this title.

to post a comment.