Discrete Mathematics – L. Lovász, J. Pelikán, K. Vesztergombi – 1st Edition


Discrete is quickly becoming one of the most important areas of mathematical research, with applications to cryptography, linear programming, coding theory and the theory of computing. This is aimed at undergraduate and science interested in developing a feeling for what is all about, where can be helpful, and what kinds of questions mathematicians work on.

The authors discuss a number of selected results and methods of , 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 to help students understand the to .

In addition, there are numerous examples, figures and exercises spread throughout the book. László is a Senior Researcher in the Theory Group at Microsoft Corporation. He is a recipient of the 1999 Wolf Prize and the Gödel Prize for the top paper in Computer Science. József is Professor of Mathematics in the Department of Algebra and Number Theory at Eötvös Loránd University, Hungary. In 2002, he was elected Chairman of the Advisory Board of the International Mathematical Olympiad. Katalin Vesztergombi is Senior Lecturer in the Department of Mathematics at the University of Washington.

Table of Content

PrefaceLet us count!Combinatorial toolsBinomial Coefficients and Pascal's TriangleFibonacci numbersCombinatorial probabilityIntegers, divisors, and primesGraphsTreesFinding the optimumMatchings in graphsCombinatorics in geometryEuler's formulaColoring maps and graphsFinite geometries, codes, Latin squares, and other pretty creaturesA glimpse of complexity and cryptographyAnswers to exercises

No Comments

  • Feedback: Leave your comments here!

    Your opinions and comments would be greatly appreciated.
    If you have comments or questions we've added this section so that we might have a dialogue with you.

Complete all fields

fifteen + 2 =