Price loading...

The Discrete Mathematical Charms of Paul Erdos: A Simple Introduction

Algorithms

Price data last checked 101 day(s) ago - refreshing...

View at Amazon

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

Description

Paul Erdős published more papers during his lifetime than any other mathematician, especially in discrete mathematics. He had a nose for beautiful, simply-stated problems with solutions that have far-reaching consequences across mathematics. This captivating book, written for students, provides an easy-to-understand introduction to discrete mathematics by presenting questions that intrigued Erdős, along with his brilliant ways of working toward their answers. It includes young Erdős's proof of Bertrand's postulate, the Erdős-Szekeres Happy End Theorem, De Bruijn-Erdős theorem, Erdős-Rado delta-systems, Erdős-Ko-Rado theorem, Erdős-Stone theorem, the Erdős-Rényi-Sós Friendship Theorem, Erdős-Rényi random graphs, the Chvátal-Erdős theorem on Hamilton cycles, and other results of Erdős, as well as results related to his work, such as Ramsey's theorem or Deza's theorem on weak delta-systems. Its appendix covers topics normally missing from introductory courses. Filled with personal anecdotes about Erdős, this book offers a behind-the-scenes look at interactions with the legendary collaborator.

Product Specifications

Format: hardcover
ASIN: 1108831834
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 26 August 2021
Listed Since: 26 November 2020

Barcode

No barcode data available

The Discrete Mathematical Charms of Paul Erdos: A Simple Introduction

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

Fundamentals of Ramsey Theory (Discrete Mathematics and Its Applications)

Connections in Discrete Mathematics: A Celebration of the Work of Ron Graham

The Mathematics of Paul Erdős II

Springer - The Mathematics of Paul Erd s I - Math Book

The Mathematics of Paul Erdős I

Basic Discrete Mathematics: Logic, Set Theory, and Probability

An Introduction to Ramsey Theory: Fast Functions, Infinity, and Metamathematics (Student Mathematical Library)

Pearls of Discrete Mathematics (Discrete Mathematics and Its Applications)

The Mathematics of Paul Erdős II: 2

Ergodic Theory: 2 (Cambridge Studies in Advanced Mathematics, Series Number 2)

Ramsey Theory on the Integers (Student Mathematical Library)

Wiley Discrete Mathematics with Proof - Second Edition

A Tale Of Discrete Mathematics: A Journey Through Logic, Reasoning, Structures And Graph Theory

A First Course in Enumerative Combinatorics (Pure and Applied Undergraduate Texts)

Pearls of Discrete Mathematics (Discrete Mathematics and Its Applications)

Invitation to Discrete Mathematics

Proofs and Fundamentals: A First Course in Abstract Mathematics: 0 (Undergraduate Texts in Mathematics)

Proofs and Fundamentals: A First Course in Abstract Mathematics (Undergraduate Texts in Mathematics)

Graph Theory and Additive Combinatorics: Exploring Structure and Randomness

Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)

Basic Discrete Mathematics: Logic, Set Theory, And Probability

Extremal Problems for Finite Sets (Student Mathematical Library)

Algebraic Combinatorics: Walks, Trees, Tableaux, and More (Undergraduate Texts in Mathematics)

Additive Combinatorics (CRM Proceedings & Lecture Notes)