This book discusses a number of selected results and methods, mostly from the areas of combinatorics and graph theory. The authors develop most topics to the extent that they can describe the discrete mathematics behind an important application of mathematics such as optimization problems, cryptography, and coding to name a few. Another feature that is not covered in other discrete mathematics books is the use of ESTIMATES (How many digits does 100! have? or Which is larger: 2^100 or 100!?). There are questions posed in the text and problems at the end of each chapter with solutions for many of them at the end of the book.

Includes supplementary material: sn.pub/extras

Auteur

László Lovász 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 Pelikán 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.

Contenu
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.