Spring 2007 Course Timetable





LECTURE NOTES  

GENERAL NOTES



1

Jan 18

Thursday

Lecture outline





2

Jan 22

Monday    

Lecture outline





3

Jan 25

Thursday

Regular graphs (Theorem 2.6, Theorem 2.7)
Degree sequences (Theorem 2.10)





4

Jan 29

Monday

Isomorphism (Theorem 3.1, 3.2, 3.5)
- as a relation (Theorem 3.6)
Reconstruction and solvability (Theorems 3.11 -- 3.14)





5

Feb 1

Thursday

Trees:
- Theorems 4.1 -- 4.9

Note: Hw1 is out. It's due Feb 12.



6

Feb 5

Monday

The minimum spanning tree problem

You can pickup handouts on the Generic MST algorithm from the box outside my office.



7

Feb 8

Thursday

Connectivity:
Theorems 5.1--5.6
Theorems 5.7--5.9





8

Feb 12

Monday

Connectivity
Lecture notes.

Hw1 due. Hw2 out.



9

Feb 15

Thursday

Connectivity cont.

  



10

Feb 20

Tuesday

Eulerian Graphs
Lecture notes








11



Feb 22



Thursday



Hamiltonian Graphs








12

Feb 26

Monday

Hamiltonian Graphs (cont)
Review Lecture

Hw2 due -- No late submissions





13

March 1

Thursday

MIDTERM






March 5-8


Spring Break







14

March 12

Monday

I will be out of town.
Nikhil will go over the midterm questions.







15

March 15

Thursday

Directed Graphs (Theorems 7.1 -- 7.5)







16

March 19

Monday

Tournaments (Theorems 7.6 -- 7.11)  







17

March 22

Thursday

Matchings
lecture notes







18

March 26

Monday

Matchings (cont)
lecture notes

Grand Marshall Wk.





19

March 29

Thursday

Flows
lecture notes

Grand Marshall Wk.





20

April 2

Monday

We will continue our discussions on flows from where we left off..

Last day to sign up for a presentation

Hw3 Out. Note the correction in Question 5: "Prove that G has a matching that saturates S union T"



21

April 5

Thursday

Planarity
Lecture notes







22

April 9

Monday

Non-planar embeddings
Lecture notes







23

April 12

Thursday

Review lecture focusing on matchings







24

April 16

Monday

Other graph parameters: coloring, independent sets and dominating sets
Lecture notes

Hw3 Due
Hw 4 Out



25

April 19

Thursday

Ramsey Theory
Lecture notes



26

April 23

Monday

Extremal Graph Theory
Theorem 11.10, (Theorem 11.11 is reading exercise), Theorem 11.15, 11.16



27

April 26

Thursday

Intro. to approximation algorithms
Lecture Notes







28

April 30

Monday

Project presentations:

  • Cindy Hui: Modeling the diffusion of warnings in a social network
  • Igor Zhitnitsky: applications on max-flow min-cut problems to logistics
  • David Cerna: Mazes
  • Xinghao Fang: Observability Analysis in Power Network State Estimation
  • He Bai: A Decentralized Design for Group Alignment and Synchronous Rotation without Inertial Frame Information


Hw4 Due





May 8

FINAL


Tuesday, 5/8, 11:30-2:30pm
Location: Sage 4101











Back to index