HW 3 comments

A--Just a notational thing that kept coming up, if m is the number of arcs, there's no need to
write |m|.  However, if A denotes the set of arcs, |A| denotes the cardinality of that set.  So,
we could say |A| = m.

B--many people assumed the result once they showed that u and v lie in different components of
the modified graph.  Take a look at the solutions.

C--many people struggled with a (particularly, in drawing a graph that corresponded to the
picture.

D--Most people got these.  For (b), there are counter examples (G2, G3, G4).  If you say a graph
is strongly connected, demonstrate a closed path that includes all the vertices.

E--Main comment--if you're describing an example in words, draw a picture of it as well.

F--be clear which direction of the proof you're working on, either by denoting "=>" or "only if",
etc.  Be precise in your wording, cite theorems where relevant.

G--most people understood this.

I encourage everyone to look at the solutions.