Office: 422 Carver Hall

email: lidicky -at- iastate.edu

Office hours: 1-2pm T and 1:30pm-2:30pm W (let me know before you come)

Where: CARVER 0174

When: Tue Thu 11:00 AM - 12:20 PM

Final exam: Mon May 2 9:45-11:45 a.m.

Lecture syllabus

Lecture log

Blackboard

ISU catalog

Textbook (gentle)

other texts (more serious)
West
Diestel

- HW #1 due to Jan 21 (before class) LaTeX template
- HW #2 due to Jan 28 (before class) LaTeX template
- HW #3 due to Feb 4 (before class) LaTeX template
- HW #4 due to Feb 11 (before class) LaTeX template
- HW #5 due to Feb 25 (before class) LaTeX template
- HW #6 due to Mar 3 (before class) LaTeX template
- HW #7 due to Mar 10 (before class) LaTeX template
- HW #8 due to Mar 31 (before class) LaTeX template
- HW #9 due to Apr 7 (before class) LaTeX template
- HW #10 due to Apr 14 (before class) LaTeX template
- HW #11 due to Apr 21 (before class) LaTeX template

- Score from tests and assignments available in Blackboard
- In case that your score on your list and in the system do not match, please let me know so I can correct the mistake.
- If you cannot participate in the class, you can email me scan of your work BEFORE the class.

- Exam 1
- Material covered: Chapters 1.?, 2.1, 2.2, 2.3, 2.4, 3.1, 3.2, 4.1, 4.2, 4.3, HW 1-4, notes 1-7.
- Date: February 11

- Exam 2
- Material covered: Chapter 4.4, 5.1, 5.2, 5.3, 5.4 and Network Flows. HW 5-7, notes 8-13
- Date: March 10

- Exam 3
- Material covered: Chapters 6.1, 6.2, 8.1, 8.2, 9.1, 9.2 HW 8-11, notes 14-21
- Date: April 21

- Final
- Date: May 2

- You may collaborate on solving the homework. However, every student is required to type the solution (her/him)self.

I will publish some short notes. They are +- extracts from the texbook. The notes are not enough to pass the class.

- Notes for Chapter 1.1 and 1.2 (basic definitions)
- Notes for Chapter 1.3 and 1.4 (basic graphs)
- Notes for Chapter 2.1 and 2.2 (degree of a vertex)
- Notes for Chapter 2.3 and 2.4 (degree sequence and adjacency matrix)
- Notes for Chapters 3.1 and 3.2 (graph isomorphism)
- Notes for Chapters 4.1 and 4.2 (trees)
- Notes for Chapters 4.2 and 4.3 (minimum spanning tree)
- Notes for Red-Blue algorithm and Chapters 4.4 Cayley formula
- Notes for Chapters 4.4 Counting spanning trees using determinants
- Notes for Chapters 5.1 and 5.2 basics of connectivity
- Notes for Chapters 5.3 and Ear decomposition theorem
- Notes for Chapters 5.4 Menger's Theorem
- Notes for Network Flows
- Notes for Chapters 8.1 Matchings I
- Notes for Chapters 8.1 Matchings II
- Notes for Chapters 6.1 Eulerian Graphs
- Notes for Chapters 6.2 Hamiltonian Graphs
- Notes for Chapters 8.2 Factorization I
- Notes for Chapters 8.2 Factorization II
- Notes for Chapters 9.1 Planar Graphs
- Notes for Chapters 9.2 Graphs on Surfaces + non-orietnable ones
- Notes for Chapters 10.2 Graph coloring
- Notes for Coloring of planar graphs