EMU math department blog

Congratulations to Dustin Good, who has been awarded the Brenneman-Longacher Endowed Mathematics Scholarship.  Dustin is a first-year student from
Harrisonburg, Virginia, who is double majoring in mathematics and computer science.  As the recipient of this scholarship, Dustin will receive $1250 per year for four years (starting with the 2007-08 year). 

The first two students chosen to receive the Brenneman-Longacher math scholarship have graduated by now.  Trevor Bare, who was the scholarship recipient in the fall of 2003, graduated in December of 2006.  After graduating, Trevor got married and moved back to Pennsylvania, where he is working as an actuary.  Tyler Yoder, the second recipient of the scholarship, completed his degree in mathematics last month.  Tyler has also moved back to his home area in Pennsylvania.

If you are planning to attend EMU and are interested in majoring in math, you should apply for the scholarship!  Send an e-mail message to smeltzed@emu.edu for more information.

Graph theory is one of the topics in discrete mathematics. It is also important for a CS major to know some graph theory since many real-life problems concerning computer networks and computer circuit design are in fact problems in graph theory.

A planar graph is a graph that can be drawn on a piece of paper without any edge crossing. It is especially important in areas of computer engineering such as VLSI design. Determining whether a given graph is planar is not hard, but finding the planar drawing of a planar graph can be quite time consuming — check out the planarity game. It took me about five minutes to finish the first three levels, then the game gets more challenging…