This is a list of errata to the book
G.E. Martin, Counting: the art of enumerative combinatorics, Springer, 2001, ISBN 0-387-95225-X.
The list is made by Tom Koornwinder.

p.18:   Skip "nonoverlapping (except at endpoints)" in item 2.
Skip "nonoverlapping" in items 4, 6, 8.

p.45, line -3:   Replace a_j by b_j.

p.123, l.-12:   Insert "of" after "couple".

p.125, l.18:   Replace "that" by "than".
Also, at the end of the line insert "aid".

P.134, l.8:   Replace n+1 by m+1.

p.157, l.4 of paragraph starting with "A subdivision":   Insert "which" after "theory".

p.161, l.23:   Insert after "that is not", at end of line: "a neighbor".

p.162, l.28:   The argument concerning connectedness is somewhat brief. One may argue as follows. Suppose there is a vertex w not lying on the obtained circuit. By connectedness there is a path from w to v. Let u be the vertex where this path first meets the circuit and let u' be the preceding vertex, which will not be on the circuit. Then u will have an edge (to u') which is not traversed by the circuit. This is a contradiction.

p.165, first paragraph:   Replace this paragraph by:
"If we assume that G contains no odd circuit then G contains certainly no odd cycle, so G is then bipartite."

p.170, l.-8:   Replace "k+1" by "k".

p.180, Corollary 1:   Insert after "edges": "and if q>1"

p.181, Corollary 3:   Insert after "edges": "and if q>1"

p.181, Corollary 5:   The formulation, although correct, is slightly confusing. More clear would be:
"A connected graph has at least one vertex of degree <6."

P.181, l.-5:   Replace "stared" by "starred".

p.186, §9, #6:   Replace "11 choose 8" by "18 choose 8".

p.186, §9, end of #9:   Replace "#8, we have 8!-7!6" by "a variant of #8, we have 7!=6!5".

p.191, §18, PIE Problems III, line 4:   Replace exponent 21 by 12.

p.220, l.-1:   Replace c_n by a_n.

p.246, Homework, Graphs 5, Answer to 1:   If the planar graph has at least two regions then every region must be bounded by at least three edges and the given reasoning is valid. Otherwise, the graph is a tree, so p=q+1 and the inequality which has to be proved is valid if q>1.

p.246, Homework, Graphs 5, Answer to 3:   If the planar graph has at least two regions then every region must be bounded by at least four edges and the given reasoning is valid. Otherwise, the graph is a tree, so p=q+1 and the inequality which has to be proved is valid if q>1.

Last modified: