Coverart for item
The Resource The mathematics of Paul Erdős II, Ronald L. Graham, Jaroslav Nešetřil, Steve Butler, Editors

The mathematics of Paul Erdős II, Ronald L. Graham, Jaroslav Nešetřil, Steve Butler, Editors

Label
The mathematics of Paul Erdős II
Title
The mathematics of Paul Erdős II
Statement of responsibility
Ronald L. Graham, Jaroslav Nešetřil, Steve Butler, Editors
Contributor
Editor
Subject
Language
eng
Summary
This is the most comprehensive survey of the mathematical life of the legendary Paul Erdős (1913-1996), one of the most versatile and prolific mathematicians of our time. For the first time, all the main areas of Erdős' research are covered in a single project. Because of overwhelming response from the mathematical community, the project now occupies over 1000 pages, arranged into two volumes. These volumes contain both high level research articles as well as key articles that survey some of the cornerstones of Erdős' work, each written by a leading world specialist in the field. A special chapter "Early Days", rare photographs, and art related to Erdős complement this striking collection. A unique contribution is the bibliography on Erdős' publications: the most comprehensive ever published. This new edition, dedicated to the 100th anniversary of Paul Erdős' birth, contains updates on many of the articles from the two volumes of the first edition, several new articles from prominent mathematicians, a new introduction, and more biographical information about Paul Erdős with an updated list of publications. The second volume contains chapters on graph theory and combinatorics, extremal and Ramsey theory, and a section on infinity that covers Erdős' research on set theory. All of these chapters are essentially updated, particularly the extremal theory chapter that contains a survey of flag algebras, a new technique for solving extremal problems
Biography type
contains biographical information
Cataloging source
GW5XE
Dewey number
510
Illustrations
illustrations
Index
no index present
LC call number
QA39.3
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorDate
1935-2020
http://library.link/vocab/relatedWorkOrContributorName
  • Graham, Ronald L.
  • Nešetřil, Jaroslav
  • Butler, Steve
http://library.link/vocab/subjectName
  • Erdős, Paul
  • Mathematics
  • Erdős, Paul
  • Mathematics
  • Mathematics, general
  • Combinatorics
  • Graph Theory
  • Mathematical Logic and Foundations
  • MATHEMATICS
  • MATHEMATICS
  • MATHEMATICS
  • Mathematics
Label
The mathematics of Paul Erdős II, Ronald L. Graham, Jaroslav Nešetřil, Steve Butler, Editors
Instantiates
Publication
Antecedent source
unknown
Bibliography note
Includes bibliographical references
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Properties of Graded Posets Preserved by Some Operations
  • Sergei L. Bezrukov, Konrad Engel
  • The Dimension of Random Graph Orders
  • Béla Bollobás, Graham Brightwell
  • Hereditary and Monotone Properties of Graphs
  • Béla Bollobás, Andrew Thomason
  • Cycles and Paths in Triangle-Free Graphs
  • Stephan Brandt
  • Problems in Graph Theory from Memphis
  • Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
  • Part I:
  • Some Remarks on the Cycle Plus Triangles Problem
  • Herbert Fleischner, Michael Stiebitz
  • Intersection Representations of the Complete Bipartite Graph
  • Zoltán Füredi
  • Reflections on a Problem of Erdős and Hajnal
  • András Gyárfás
  • The Chromatic Number of the Two-Packing of a Forest
  • Hong Wang, Norbert Sauer
  • Combinatorics and graph theory.
  • Reconstruction Problems for Digraphs
  • Martin Aigner, Eberhad Triesch
  • Neighborly Families of Boxes and Bipartite Coverings
  • Noga Alon
  • On the Isolation of a Common Secret
  • Don Beaver, Stuart Haber, Peter Winkler
  • András Hajnal
  • Set Theory: Geometric and Real
  • Péter Komjáth
  • On Order-Perfect Lattices
  • Igor Kříž
  • The PCF Theorem Revisited
  • Saharan Shelah
  • Paul Erdős: The Master of Collaboration
  • Jerrold W. Grossman
  • Part III:
  • Infinity.
  • A Few Remarks on a Conjecture of Erdős on the Infinite Version of Menger's Theorem
  • Ron Aharoni
  • The Random Graph
  • Peter J. Cameron
  • Paul Erdős' Set Theory
Control code
856631661
Dimensions
unknown
Edition
Second edition.
Extent
1 online resource (xix, 607 pages)
File format
unknown
Form of item
online
Isbn
9781461472544
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
  • 10.1007/978-1-4614-7254-4
  • 9781461472537
Other physical details
illustrations
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)856631661
Label
The mathematics of Paul Erdős II, Ronald L. Graham, Jaroslav Nešetřil, Steve Butler, Editors
Publication
Antecedent source
unknown
Bibliography note
Includes bibliographical references
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Properties of Graded Posets Preserved by Some Operations
  • Sergei L. Bezrukov, Konrad Engel
  • The Dimension of Random Graph Orders
  • Béla Bollobás, Graham Brightwell
  • Hereditary and Monotone Properties of Graphs
  • Béla Bollobás, Andrew Thomason
  • Cycles and Paths in Triangle-Free Graphs
  • Stephan Brandt
  • Problems in Graph Theory from Memphis
  • Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
  • Part I:
  • Some Remarks on the Cycle Plus Triangles Problem
  • Herbert Fleischner, Michael Stiebitz
  • Intersection Representations of the Complete Bipartite Graph
  • Zoltán Füredi
  • Reflections on a Problem of Erdős and Hajnal
  • András Gyárfás
  • The Chromatic Number of the Two-Packing of a Forest
  • Hong Wang, Norbert Sauer
  • Combinatorics and graph theory.
  • Reconstruction Problems for Digraphs
  • Martin Aigner, Eberhad Triesch
  • Neighborly Families of Boxes and Bipartite Coverings
  • Noga Alon
  • On the Isolation of a Common Secret
  • Don Beaver, Stuart Haber, Peter Winkler
  • András Hajnal
  • Set Theory: Geometric and Real
  • Péter Komjáth
  • On Order-Perfect Lattices
  • Igor Kříž
  • The PCF Theorem Revisited
  • Saharan Shelah
  • Paul Erdős: The Master of Collaboration
  • Jerrold W. Grossman
  • Part III:
  • Infinity.
  • A Few Remarks on a Conjecture of Erdős on the Infinite Version of Menger's Theorem
  • Ron Aharoni
  • The Random Graph
  • Peter J. Cameron
  • Paul Erdős' Set Theory
Control code
856631661
Dimensions
unknown
Edition
Second edition.
Extent
1 online resource (xix, 607 pages)
File format
unknown
Form of item
online
Isbn
9781461472544
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
  • 10.1007/978-1-4614-7254-4
  • 9781461472537
Other physical details
illustrations
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)856631661

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
Processing Feedback ...