search

oscarlevin / discrete-book

An open textbook for Discrete Mathematics, as taught at the University of Northern Colorado
http://discrete.openmathbooks.org/dmoi3.html
Other
208 stars 64 forks source link

Potential rewording for Example 4.2.6 #130

Closed SerDigby closed 1 year ago

SerDigby commented 1 year ago

Hi,

Example 4.2.6 says "Explain why every tree is a bipartite graph." The provided definition of a tree is "a connected graph containing no cycles". By this definition, a single vertex is a tree. Since a single vertex cannot be bipartite, the question and solution might need to be reworded.

Thanks!

EDIT: I've been informed that a graph with no edges can be bipartite, so the question and solution don't have any issues. Cheers.

oscarlevin commented 1 year ago

Yeah, these "trivial" cases are annoying, and I often forget about them. So thanks for the heads up and keeping me honest.