Revision as of 19:26, 13 January 2009 by Podarcze (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

My favorite theorem would have to be one that we learned last semester in MA 375: v+f=e+2. This talks about the idea that the number of verticies + the faces of a graph is equal to 2 more that the number of edges used to make the graph. I thought about this long and hard to see why it worked, but every time, it did.

Alumni Liaison

Recent Math PhD now doing a post-doctorate at UC Riverside.

Kuei-Nuan Lin