What question did this study set out to answer?

This review evaluates two significant works on random graphs within the realm of discrete mathematics and optimization.

May 1, 2001

RANDOM GRAPHS (Wiley Interscience Series in Discrete Mathematics and Optimization) By SVANTE JANSON, TOMASZ ŁUCZAK and ANDRZEJ RUCIŃSKI: 333 pp. , US48. 50, ISBN 0-471-17541-2 (John Wiley & Sons, New York, 2000). RANDOM GRAPHS (Encyclopaedia of Mathematics and its Applications 53) By V. F. KOLCHIN: 252 pp. , US50, ISBN 0-521-44081-5 (Cambridge University Press, 1999).

Key Points

This review evaluates two significant works on random graphs within the realm of discrete mathematics and optimization.
Examined 'Random Graphs' by Svante Janson et al. and 'Random Graphs' by V. F. Kolchin.
Analyzed the content, structure, and contributions of both books to the field.
Highlighted key concepts introduced in each book, emphasizing their practical implications in graph theory.
Discussed the different approaches to understanding random graphs presented by the authors.

Abstract

RANDOM GRAPHS (Wiley Interscience Series in Discrete Mathematics and Optimization) By SVANTE JANSON, TOMASZ ŁUCZAK and ANDRZEJ RUCIŃSKI: 333 pp. , US48. 50, ISBN 0-471-17541-2 (John Wiley & Sons, New York, 2000). RANDOM GRAPHS (Encyclopaedia of Mathematics and its Applications 53) By V. F. KOLCHIN: 252 pp. , US50, ISBN 0-521-44081-5 (Cambridge University Press, 1999). - Volume 33 Issue 3

Bookmark

Key Points

Abstract

Cite This Study

Also Consider

Also Consider