Advertisement

Discrete Mathematics

Elementary and Beyond

  • L. Lovász
  • J. Pelikán
  • K. Vesztergombi

Part of the Undergraduate Texts in Mathematics book series (UTM)

Table of contents

  1. Front Matter
    Pages i-ix
  2. L. Lovász, J. Pelikán, K. Vesztergombi
    Pages 1-24
  3. L. Lovász, J. Pelikán, K. Vesztergombi
    Pages 25-42
  4. L. Lovász, J. Pelikán, K. Vesztergombi
    Pages 43-64
  5. L. Lovász, J. Pelikán, K. Vesztergombi
    Pages 65-75
  6. L. Lovász, J. Pelikán, K. Vesztergombi
    Pages 77-85
  7. L. Lovász, J. Pelikán, K. Vesztergombi
    Pages 87-123
  8. L. Lovász, J. Pelikán, K. Vesztergombi
    Pages 125-140
  9. L. Lovász, J. Pelikán, K. Vesztergombi
    Pages 141-156
  10. L. Lovász, J. Pelikán, K. Vesztergombi
    Pages 157-164
  11. L. Lovász, J. Pelikán, K. Vesztergombi
    Pages 165-178
  12. L. Lovász, J. Pelikán, K. Vesztergombi
    Pages 179-187
  13. L. Lovász, J. Pelikán, K. Vesztergombi
    Pages 189-196
  14. L. Lovász, J. Pelikán, K. Vesztergombi
    Pages 197-210
  15. L. Lovász, J. Pelikán, K. Vesztergombi
    Pages 211-238
  16. L. Lovász, J. Pelikán, K. Vesztergombi
    Pages 239-250
  17. L. Lovász, J. Pelikán, K. Vesztergombi
    Pages 251-286
  18. Back Matter
    Pages 287-292

About this book

Introduction

 Discrete mathematics 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 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.

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.

Keywords

Combinatorics Matching Prime coding theory combinatorial geometry cryptography graph theory linear optimization number theory

Authors and affiliations

  • L. Lovász
    • 1
  • J. Pelikán
    • 2
  • K. Vesztergombi
    • 3
  1. 1.Microsoft ResearchMicrosoft CorporationRedmondUSA
  2. 2.Department of Algebra and Number TheoryEõtvõs Loránd UniversityBudapestHungary
  3. 3.Department of MathematicsUniversity of WashingtonSeattleUSA

Bibliographic information

  • DOI https://doi.org/10.1007/b97469
  • Copyright Information Springer-Verlag New York 2003
  • Publisher Name Springer, New York, NY
  • eBook Packages Springer Book Archive
  • Print ISBN 978-0-387-95585-8
  • Online ISBN 978-0-387-21777-2
  • Series Print ISSN 0172-6056
  • Series Online ISSN 2197-5604
  • Buy this book on publisher's site