Oscar Levin
Oscar Levin
WeBWorK problems currently use some default error tolerance, which doesn't make sense for questions where the answer is large. These should be fixed to require exact answers.
Students report that the discussion about cliques in the vertex coloring section is confusing. Some examples of this would help. Also, what does "pairwise adjacent" mean?
I am unclear about how much computer science related material to include. Perhaps some asides, maybe some specific exercises, maybe a separate edition of the book (Discrete Mathematics: an Open...
As an additional topic, infinite cardinalities would be a good section, as requested by a few users.
Maybe. This seems to be too complex to include in the main exposition, and the complexity doesn't have much to do with Euler's formula.
How many paths are there in a tree with n vertices?
A nice Venn diagram for 3 sets, that really needs to be build up from simpler examples.
The main issue here is the inconsistency with the use of the word "path". But also, this section could be expanded quite a bit to make that issue clearer, to...
A instructor at Georgia Tech likes the book, but needs content on Boolean Algebras. Perhaps additional topics? Or as part of logic? The print version is getting long. Maybe some...
This would be good for my students, and was requested by another instructor. Could be woven in, or as part of a "discrete structures" section in chapter 0 or 5.