Image from Coce

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

By: Contributor(s): Material type: TextTextSeries: Undergraduate texts in mathematicsAnalytics: Show analyticsPublisher: New York : Springer, [2003]Copyright date: ©2003Description: ix, 290 pages : illustrations ; 25 cmContent type:
  • text
Media type:
  • unmediated
Carrier type:
  • volume
ISBN:
  • 0387955844
  • 9780387955841
  • 0387955852
  • 9780387955858
Subject(s): DDC classification:
  • 510 21
LOC classification:
  • QA39.3 .L68 2003
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."--BOOK JACKET.
Tags from this library: No tags from this library for this title. Log in to add tags.

Includes 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."--BOOK JACKET.

Machine converted from AACR2 source record.

There are no comments on this title.

to post a comment.

Powered by Koha