The discrete mathematical charms of Paul Erdős : a simple introduction / Vašek Chvátal.
Chvátal, Vašek, 1946-| Call Number | 511/.1 |
| Author | Chvátal, Vašek, 1946- author. |
| Title | The discrete mathematical charms of Paul Erdős : a simple introduction / Vašek Chvátal. |
| Physical Description | 1 online resource (xv, 248 pages) : digital, PDF file(s). |
| Notes | Title from publisher's bibliographic system (viewed on 05 Aug 2021). |
| Contents | A glorious beginning : Bertrand's postulate -- Discrete geometry and spinoffs -- Ramsey's theorem -- Delta-systems -- Extremal set theory -- Van der Waerden's theorem -- Extremal graph theory -- The friendship theorem -- Chromatic number -- Thresholds of graph properties -- Hamilton cycles. |
| Summary | 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. |
| Subject | Erdős, Paul, 1913-1996. DISCRETE MATHEMATICS. Mathematicians Hungary Biography. |
| Multimedia |
Total Ratings:
0
02781nam a22003978i 4500
001
vtls001594288
003
VRT
005
20220808222500.0
006
m|||||o||d||||||||
007
cr||||||||||||
008
220808s2021||||enk o ||1 0|eng|d
020
$a 9781108912181 (ebook)
020
$z 9781108831833 (hardback)
020
$z 9781108927406 (paperback)
035
$a (UkCbUP)CR9781108912181
039
9
$y 202208082225 $z santha
040
$a UkCbUP $b eng $e rda $c UkCbUP
043
$a e-hu---
050
0
0
$a QA297.4 $b .C48 2021
082
0
0
$a 511/.1 $2 23
100
1
$a Chvátal, Vašek, $d 1946- $e author.
245
1
4
$a The discrete mathematical charms of Paul Erdős : $b a simple introduction / $c Vašek Chvátal.
264
1
$a Cambridge : $b Cambridge University Press, $c 2021.
300
$a 1 online resource (xv, 248 pages) : $b digital, PDF file(s).
336
$a text $b txt $2 rdacontent
337
$a computer $b c $2 rdamedia
338
$a online resource $b cr $2 rdacarrier
500
$a Title from publisher's bibliographic system (viewed on 05 Aug 2021).
505
0
$a A glorious beginning : Bertrand's postulate -- Discrete geometry and spinoffs -- Ramsey's theorem -- Delta-systems -- Extremal set theory -- Van der Waerden's theorem -- Extremal graph theory -- The friendship theorem -- Chromatic number -- Thresholds of graph properties -- Hamilton cycles.
520
$a 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.
600
1
0
$a Erdős, Paul, $d 1913-1996.
650
0
$a DISCRETE MATHEMATICS.
650
0
$a Mathematicians $z Hungary $v Biography.
776
0
8
$i Print version: $z 9781108831833
856
4
0
$u https://doi.org/10.1017/9781108912181
999
$a VIRTUA
No Reviews to Display
| Summary | 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. |
| Notes | Title from publisher's bibliographic system (viewed on 05 Aug 2021). |
| Contents | A glorious beginning : Bertrand's postulate -- Discrete geometry and spinoffs -- Ramsey's theorem -- Delta-systems -- Extremal set theory -- Van der Waerden's theorem -- Extremal graph theory -- The friendship theorem -- Chromatic number -- Thresholds of graph properties -- Hamilton cycles. |
| Subject | Erdős, Paul, 1913-1996. DISCRETE MATHEMATICS. Mathematicians Hungary Biography. |
| Multimedia |