Typos

[mitchkeller]

Here are some errors I noticed over the semester, mostly typos. Thanks again!

Chapter 2, Exercise 32 "and 0 of are painted red" should be "and 0 are painted red".

Section 5.3: missing comma in part 2 of the definition of eulerian (before "t-1")

Section 5.3: Sage code gives error "Missing parentheses in call to 'print'."

Section 5.4: Definition of proper coloring "such that if" should be "such that"

Section 5.4: Definition of bipartite graph, should be "partition of the vertex set V"

Section 5.4, right before "5.4.3 Can We Determine Chromatic Number". The line "where we show that are there graphs with large chromatic" should have "are" and "there" swapped

Section 5.6, in the Proof of Cayley's Theorem, second paragraph, "which can only happen T\cong K_2" is missing "if"

Section 13.5, in the paragraph on "First Labeled, First Scanned". In your example, you imply that vertex G is labeled twice, even though vertices can only be labeled once.

Section 16.1, second paragraph "information at to which of the" should be "as to" instead of "at to"

Section 16.4, in the definition of "stable", I (think) number 3 should be "g' prefers b to b'".

Dennis Hall, PhD Associate Professor, Mathematics Angelo State University

[mitchkeller]

Right before equation 8.1.1 there is an unclosed parenthesis in the previous displayed equation.

[mitchkeller]

Typos through chapter 5 have been fixed in source.

[mitchkeller]

The typos here are all fixed. The following item remains open because it requires rewriting of that section in the next edition:

Section 16.4, in the definition of "stable", I (think) number 3 should be "g' prefers b to b'".

[mitchkeller]

Theorem 5.18 should assume n\geq 3, since K_2 satisfies the hypothesis but is not hamiltonian. (Peijia Guo, U Toronto)

[mitchkeller]

in example 6.3 ,chapt 6.1, the solution of which writes, "note that R5 is a partial order on{a,b,d,e}". as a beginner, i'm not sure if my judgment is correct or not, but i think R5 may be a partial order on{a,c,d,e}? (Zhou Qy, Beijing Normal U)

[mitchkeller]

In the proof of Lemma 8.12, \binom{2m+2}{m+2} should be \binom{2m+2}{m+1}. (David Soknacki, U of Toronto)

[mitchkeller]

Proof of Theorem 5.21: "if x_1 \neq y_j for all" should be "if x_i\neq y_j for all" in the line after the display ending = y. (Tung T. Nguyen, Lake Forest College)

Same correspondent also wrote "Many students in my class are computer science major. For Chapter 3, I plan to introduce some problems in CS such as the minimum coin change problem that can be solved recursively."