8000 Typos · Issue #41 · mitchkeller/applied-combinatorics · GitHub
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content

Typos #41

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
mitchkeller opened this issue Nov 29, 2022 · 7 comments
Open

Typos #41

mitchkeller opened this issue Nov 29, 2022 · 7 comments
8000

Comments

@mitchkeller
Copy link
Owner

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
Copy link
Owner Author

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

@mitchkeller
Copy link
Owner Author

Typos through chapter 5 have been fixed in source.

@mitchkeller
Copy link
Owner Author

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
Copy link
Owner Author

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

@mitchkeller
Copy link
Owner Author

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
Copy link
Owner Author

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
Copy link
Owner Author
mitchkeller commented Sep 17, 2024

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."

< 4C73 p class="ml-1 mb-2 mt-2" data-show-on-error hidden> Sorry, something went wrong.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant
0