• (Θ 4/26) Presentations: (Attendance is mandatory)
  • (11:00) Kirsten Hogenson: "Minimum degree thresholds for bipartite graph tiling" by Albert Bush and Yi Zhao
  • (11:20) Zhanar Berikkyzy: "The extremal function for unbalanced bipartite minors" by Joseph Samuel Myers [Computer]
• (11:40) Chelsea Peck: "On winning fast in Avoider-Enforcer games" by János Barát and Miloš Stojaković
• (12:00) José Ponce: "An approximate version of the Loebl-Komlós-Sós conjecture" by Diana Piguet and Maya J. Stein
• (T 4/24) Presentations: (Attendance is mandatory)
  • (11:00) Lauren Herrmann: "Spanning trees with many leaves and average distance" by Ermelinda DeLaViña and Bill Waller
  • (11:20) Arianne Ross: "Propagation time for zero forcing on a graph" by L. Hogben, M. Huynh, N. Kinglsey, S. Meyer, S. Walker and M. Young [Computer]
  • (11:40) Nathan Warnberg: "A new method to construct lower bounds for Van der Waerden numbers" by P.R. Herwig, M.J.H. Heule, P.M. van Lambalgen and H. van Maaren [Computer]
• (12:00) Steven Osborne: "On graphs containing no complete subgraphs with 4 vertices" by Endre Szemerédi (as found in "Szemerédi's Regularity Lemma and its applications in graph theory" by János Komlós and Miklós Simonovits)
• (12:25) Kevin Moss: "Proof of the (n/2-n/2-n/2) Conjecture for Large n" by Yi Zhao
• (4/17, 4/19) Week 14 topic: Edit distance and related topics
• (4/10, 4/12) Week 13 topic: (Guest lecturer: Michael Young) The Hoffman-Singleton theorem, entropy and counting
• (4/03, 4/05) Week 12 topic: Multipartite version of Hajnal-Szemerédi, induced subgraphs using the regularity lemma, edit distance
• (3/27, 3/29) Week 11 topic: Zhao's theorem on bipartite tiling
• (3/20, 3/22) Week 10 topic: Erdős-Stone-Simonovits, degree form of RegLem, the Blow-up lemma, Alon-Yuster
• (3/06, 3/08) Week 9 topic: Proof of Szemerédi's Regularity Lemma, Erdős-Stone-Simonovits
• Special Note: On Thursday, March 01, class will be held in 401 Carver Hall from 11:00-12:20.
• (2/28, 3/01) Week 8 topic: Quick proof that bipartite graphs are in dense graphs' Proof of Szemerédi's Regularity Lemma
• (2/21, 2/23) Week 7 topic: Regular pairs: Preparing for Szemerédi's Regularity Lemma
• (2/14, 2/16) Week 6 topic: Concentration inequalities, Lovász Local Lemma
• (2/07, 2/09) Week 5 topic: Conditional probability, martingales
• (1/31, 2/02) Week 4 topic: Probability theory, random graphs, alteration method
• (1/24, 1/26) Week 3 topic: Ramsey theory
• (1/17, 1/19) Week 2 topic: Dirac/Ore, The Hajnal-Szemerédi theorem
• (1/10, 1/12) Week 1 topic: König-Hall, Turán, Eulerian graphs

I have been compiling notes in a book form.  I will periodically update this document.  This is a very rough document and is only intended to be my notes and references.  The information contained therein may be wrong, especially with regard to proper references.  Click here for the PDF. It may be a long time between updates.

Click here for the Course Syllabus

• Click here for the ISU Spring 10 Extremal Graph Theory page.
• Click here for the ISU Spring 08 Extremal Graph Theory page.
• Click here for the ISU Spring 06 Extremal Graph Theory archive page.
• Click here for the CMU Fall 02 Extremal Graph Theory archive page.

Homeworks:

• Homework 1 due January 31 (tex file)
• Homework 2 due February 16 (tex file)
• Homework 3 due March 8 (tex file) [No late submissions]
• Homework 4 due April 5 (tex file)
• Final Exam due May 1 at 11:00am (tex file) [No late submissions]
• Final Exam Solutions