The Mathematics of Paul Erdös II

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

Ronald L. Graham is currently Professor of Mathematics and Irwin and Joan Jacobs Professor of Computer and Information Sciences at the University of California, San Diego, and Chief Scientist at the California Institute for Telecommunications and Information Technology.

Jaroslav Nesetril is currently Professor of Mathematics and Director of the Institute of Theoretical Computer Science at Charles University, Prague.

Steve Butler is currently Assistant Professor of Mathematics at Iowa State University.