Course Policy sheet for Math 5454 ( CRN 96697)
Graph Theory
Fall 2009

Instructor:
Ezra Brown
Office:
568 McBryde
Office Phone : 231-6950
Home Phone : 552-9563 (before 9 PM)
E-mail :
ezbrown@math.vt.edu
Office Hours:
MWF 10:00-11:30 am
TuTh 3:00-4:30 pm
& by appointment

Time and Place: 1:25 to 2:15 p.m. Mondays, Wednesdays, and Fridays, McBryde 240

Text: "Introduction to Graph Theory (2nd edition)" by D. B. West

Hints for Success

Topics and Content: Graph Theory is a branch of mathematics whose deceptive simplicity disguises its vast applicability. It will model almost any situation involving a finite number of objects that have some sort of relation among themselves. I've got a little list of some of them, followed by the relevant area of graph theory (and by the way, this list is just scratching the surface):

The subject also contains many beautiful and elegant results, including the Max Flow Min Cut Theorem, Kuratowski's characterization of planar graphs, the algorithms of Kruskal, Prim and Dijkstra, Cayley's Labeled Trees Theorem, Euler's characterization of traversable networks, and the Four Color Theorem.

Material will be taken from Chapters 1, 2, 3, 4, 6 and 8 of the text.

Prerequisites: Consent. See Instructor for details.

Evaluation: There will be regular problem sets, worth 1/3 of your grade. There will be two mid-term exams, each counting 2/9 of your grade; these are currently scheduled for late September and early November. The final exam will count 2/9 of your grade, and is scheduled for Tuesday, December 15 from 3:25 to 5:25 p.m. Giving or receiving assistance on the mid-term exams or final exam (except that specified by the instructor) is a violation of the honor code.


Problem Sets for Fall 2009


Problem Sets Policy: You may consult with others on the problem sets, but the work you hand in must reflect your own understanding of a particular problem. For the most part, this policy works very well, since much of what you learn about discrete mathematics will come from conversations with your fellow students. However, I will change this policy - reluctantly - if it is being abused.

More about Problem Sets: Problem sets are to be done on either a word-processor (e.g. Word, with either MathType (usually included) or Equation Editor) or a type-setting program such as LaTeX. Include your name, the date, and the problem set number. Include the problem statement for each problem. Hand the problem sets in flat, and staple them in the upper left corner.

Late Work and Test Policy: A problem set is late after the end of class on the day it is due. Late problem sets count zero. I do not give make-up exams; however, I will substitute your final exam grade for at most one of your in-class exams, if such a substitution is to your advantage. In addition, because of the nature of the subject, you often do not have time to complete ``hour exams'' during a 75-minute class meeting. Hence, I will schedule your "in-class" tests in the evenings, to be given from 7 to 10, so that you will have ample time to finish. You may not make up a missed final exam.

Grading: A percentage grade of 90, 80, 70 or 60 on any piece of work guarantees you a grade of A-, B-, C- or D-, respectively. Plusses and minuses are judgment calls and not subject to debate. Graduate students should note that the Graduate School converts any grade below C- to an F.

Honor System: The University Honor System is in effect for the midterm exams, the final exam and the graded problem sets.

IMPORTANT MESSAGE!! If you are not on the class roll that comes out after the last add date, immediately check your schedule at a terminal and start attending the proper section. For no forseeable reason (computer and registrar personnel mistakes included) will you be allowed to stay in the wrong section or to drop a section for which you are actually enrolled after the last drop date.