The mathematics of Paul Erdős. II

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

Celý popis

Uloženo v:
Podrobná bibliografie
Další autoři: Graham, Ronald Lewis, 1935-2020 (Šéfredaktor, odpovědný redaktor), Nešetřil, Jaroslav, 1946-...., Mathématicien (Šéfredaktor, odpovědný redaktor), Butler, Steve, 1977- (Šéfredaktor, odpovědný redaktor)
Médium: Livre numérique
Jazyk:Anglais
Vydáno: New York, NY : Springer New York [20..].
Cham : Springer Nature
Vydání:2nd ed. 2013.
On-line přístup:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Poznámka: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• The Mathematics of Paul Erdös, II, Ronald L. Graham, Jaroslav Nešetřil (Eds.), 1997, Berlin[etc.], Springer-Verlag, 1 vol. (XVI-577 p.), Algorithms and Combinatorics, 3-540-61031-6
Obsah:
  • VOLUME II Part I Combinatorics and Graph Theory Introduction Reconstruction Problems for Digraphs Neighborly Families of Boxes and Bipartite Coverings On the Isolation of a Common Secret Properties of Graded Posets Preserved by Some Operations The Dimension of Random Graph Orders Hereditary and Monotone Properties of Graphs Cycles and Paths in Triangle-Free Graphs Problems in Graph Theory from Memphis Some Remarks on the Cycle Plus Triangles Problem Intersection Representations of the Complete Bipartite Graph Reflections on a Problem of Erdős and Hajnal The Chromatic Number of the Two-Packing of a Forest Part II Ramsey and Extremal Theory Introduction Ramsey Theory in the Work of Paul Erdős Memories on Shadows and Shadows of Memories A Bound of the Cardinality of Families Not Containing -Systems Flag Algebras: An Interim Report Arrangeability and Clique Subdivisions A Finite Partition Theorem with Double Exponential Bound Paul Erdős' Influence on Extremal Graph Theory Applications of the Probabilistic Method to Partially Ordered Sets Part III Infinity Introduction A Few Remarks on a Conjecture of Erdős on the Infinite Version of Menger's Theorem The Random Graph Paul Erdős' Set Theory Set Theory: Geometric and Real On Order-Perfect Lattices The PCF Theorem Revisited Paul Erdős: The Master of Collaboration List of Publications of Paul Erdős Postscript