(New page: 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...) |
|||
| Line 1: | Line 1: | ||
| + | [[Category:MA453Spring2009Walther]] | ||
| + | |||
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. | 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. | ||
Latest revision as of 09:21, 27 January 2009
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.
