# ``Extremal Graph Theory (TAC: Vol. I)'' - Typos

This page lists the typographical errors that have been discovered in
the Spring 2011 or 2013 pre-publication versions of
*Extremal Graph Theory*, by Douglas B. West (Volume I of
*The Art of Combinatorics*).
This page is of interest only to the few persons having a copy of this
draft, such as the students in my course and possibly reviewers.
Please send any additional contributions to *west@math.uiuc.edu*.
Contributors noted in parentheses.

## Corrections to the printed version

- page 65, before Proposition 1.2.17: "extras edges" should be "extra edges"
(Ilkyoo Choi)
- page 65, Proposition 1.2.18: "has path" should be "has a path"
- page 99, Example 1.3.22: "bandwidth equal" should be "bandwidth equals"
- page 127, Theorem 2.1.28: "Lmaxdef" should be "Lemma 2.1.26"
- page 177, below "FACTORS": "specifying" should be "specify" (Ilkyoo
Choi)
- page 191, Example 2.3.16 (2013 version): "
*T=U*" should be "*T=X*"
(Michael Santana)
- page 191, Theorem 2.4.13 (2013 version): "no neighbors in
*x*" should
be "no neighbors in *N[x]*" (Michael Santana)
- page 201, Theorem 2.4.13: "
*α(G)=f(G')*" should be
"*α(G')=f(G')*"
- page 211, Theorem 2.4.26: "from from" should be "from"
- page 219, Exercise 2.4.25: Delete "
*Y,Z*"
- page 221, Exercise 2.4.49: Part (c) was mislabeled a second part (a), and in
this part the parameter should again be
*γ*_{t}
- page 322-323: Exercise 3.3.28 repeats Exercise 3.3.17 and is contained in
Exercise 3.3.27
- page 530, Theorem 5.1.3: "is a disjoint union" should be "fails to be a
disjoint union"
- page 536, Example 5.1.16: "(19,5,16)" should be in the subscript
- page 537, middle: "Hajanl" should be "Hajnal"
- page 537, Theorem 5.1.19: In the mention of
*K*_{b}∨ ͞K͞_{|V(H)|-b}, each *b* should
be *b+1*
- page 554, Corollary 5.1.54: In the display, the two unsubscripted instances
of
*k* should be *s*