# Random Graphs: Errata

This file lists known errors in
*Random Graphs*
by Svante Janson, Tomasz Luczak and Andrzej Rucinski,
published February 2000 by
John Wiley & Sons, N.Y.
(ISBN 0-471-17541-2).
Some comments on futher results are included at the end.
We thank the people that have contributed with corrections.
The authors are grateful for reports of all further errors, for
example by e-mail to
Svante Janson,
Tomasz Luczak,
or
Andrzej Rucinski.

iii (title page):
Both Tomasz Luczak and Andrzej Rucinski
have double affiliations; Adam Mickiewicz University, Poznan, Poland
and Emory University, Atlanta, Georgia.

Moreover, there should be an accent over `n' in Rucinski.

(March 3, 2000)

page 50, Remark 2.47:
"log" should be deleted.

(Jan 11, 2009)

page 57, Remark 3.7:
"G(n,p)\not\supset G" should be "G(n,p)\supset G"

(May 9, 2005)

pp. 96, 97, 98, 100, 318:
Krivelevich (1996a) should be Krivelevich (1997).

pp. 102, 318:
Krivelevich (1996b) should be Krivelevich (1996).

p. 318: The order of these two references should be changed.

(March 21, 2000)

page 110, line 3:
"saturated" should be "unsaturated"
(March 29, 2007)

Theorem 5.19:
The sum should extend from l=1, not 3.

(June 15, 2000)

page 151, lines 4-5:
"v_{G}"
should be
"e_{G}".
(March 29, 2007)

pages 180-181 are missing in some copies. A
copy of pages 180-181 is available here.

Proof of Theorem 9.5, page 237, line before (9.2):
"p_{i}, q_{i}"
should be
"x_{i}, y_{i}"

(November 22, 2005)

Theorem 9.13:
"the event W>0" should be "the event W=0".

(June 20, 2000)

Section 9.6, page 264, the line before **Definition**:
"space" should be "spaces".

(April 10, 2001)

p. 308, "distribution of subgraphs" should be
"distributions of subgraph".

(April 10, 2001)

p. 316,
Janson, Knuth, Luczak & Pittel (1993):
The volume number should be 4.

(March 3, 2000)

p. 332: "Ehrenhfeucht" should be "Ehrenfeucht".

(April 10, 2001)

p. 332: "Hölder's inequality"
should be listed before "Hypercube".

(April 10, 2001)

## Further comments

Remark 9.38:
Pontus Andersson has found an
example
showing that monotonicity may
fail also for the graphs G(n,r).

(June 15, 2000)

Remark 9.45:
The conjecture has been proved by
Greenhill, Kim, Janson and Wormald,
see
Permutation pseudographs and contiguity
,
*Combin. Probab. Comput.*
**11** (2002), no. 3, 273-298.

*
Svante
Janson,
svante.janson@math.uu.se
Last modified:
*