List of Speakers:

  • Aug 27 Monday: Ping Hu:
  • Bobby DeMarco, Jeff Kahn: Mantel's Theorem for random graphs.

  • Aug 29 Wednesday: Ping Hu:
  • WORK IN PROGRESS: Cancellative subgraphs of random graphs.

  • Aug 31 Friday: Bernard Lidicky:
  • Ken-ichi Kawarabayashi and Carsten Thomassen: From the plane to higher surfaces.

    Talks next in line:

  • Sep 5 Wednesday: Ilkyoo Choi:
  • Xuding Zhu: The fractional version of Hedetniemi's Conjecture. I.

    Talks next in line:

  • Sep 7 Friday: Ilkyoo Choi:
  • Xuding Zhu: The fractional version of Hedetniemi's Conjecture. II.

  • Sep 7 Friday: Matthew Yancey:
  • Albertson, Cranston and Fox: On coloring graphs with small crossing numbers. I.

  • Sep 12 Monday: Hong Liu
  • WORK IN PROGRESS: On Duffus-Luczak- Rodl's Conjecture I.

  • Sep 12 Wednesday: Hong Liu
  • WORK IN PROGRESS: On Duffus-Luczak-Rodl's Conjecture II.

  • Sep 14 Friday: Matthew Yancey:
  • Albertson, Cranston and Fox: On coloring graphs with small crossing numbers. II.

  • Sep 17 Monday: Elyse Yeager
  • Chudnovsky et al: Tournaments and colouring.

  • Sep 19 Wednesday: Ben Reiniger
  • David Conlon, Jacob Fox, Benny Sudakov: An improved bound for the stepping-up lemma.

  • Sep 21 Friday: Independent work on problems


  • Sep 24 Monday : Santana, Michael L
  • Kostochka, A. V. The non-existence of certain generalized friendship graphs. Combinatorics (Eger, 1987), 341–356, Colloq. Math. Soc. János Bolyai, 52, North-Holland, Amsterdam, 1988.

  • Sep 26 Wednesday: Thomas Mahoney
  • Cai, Leizhen; Wang, Weifan; Zhu, Xuding Choosability of toroidal graphs without short cycles. J. Graph Theory 65 (2010), no. 1, 1–15.

  • Sep 28 Friday: Kolb, Hannah R
  • WORK IN PROGRESS: Hypergraphic Sequences.

  • Oct 1 Monday: Hong Liu
  • Heidi Gebauer and T. Szabó: Asymptotic Random Graph Intuition for the Biased Connectivity Game I., Random Structures and Algorithms, 35 (2009), 431-443.

  • Oct 3 Wednesday: Hong Liu
  • Heidi Gebauer and T. Szabó: Asymptotic Random Graph Intuition for the Biased Connectivity Game II., Random Structures and Algorithms, 35 (2009), 431-443.

  • Oct 5 Friday: Kolb, Hannah R
  • Heidi Gebauer: Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges I., http://arxiv.org/abs/0911.0900

  • Oct 8 Monday: Kolb, Hannah R
  • Heidi Gebauer: Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges II., http://arxiv.org/abs/0911.0900

  • Oct 10: Gregory Puleo,
  • Alon Noga: Explicit Ramsey graphs and orthonormal labelings. Electron. J. Combin. 1 (1994), Research Paper 12, approx. 8 pp. (electronic)

  • Oct 12 Friday: Independent work on problems
  • Oct 15 Monday: Independent work on problems
  • Oct 17 Wednesday: Jaehoon Kim
  • T. Luczak and S. Thomasse: Coloring dense graphs via VC-dimension. and P. Allen, J. Bottcher, S. Griffiths, Y. Kohayakawa, and R. Morris: Chromatic thresholds of graphs. I.

  • Oct 19 Friday: Jaehoon Kim
  • T. Luczak and S. Thomasse: Coloring dense graphs via VC-dimension. and P. Allen, J. Bottcher, S. Griffiths, Y. Kohayakawa, and R. Morris: Chromatic thresholds of graphs. II.

  • Oct 22 Monday: Jaehoon Kim
  • T. Luczak and S. Thomasse: Coloring dense graphs via VC-dimension. and P. Allen, J. Bottcher, S. Griffiths, Y. Kohayakawa, and R. Morris: Chromatic thresholds of graphs. III.

  • Oct 24: John Lenz
  • Hypergraph quazi randomness.

  • Oct 26: Friday: Independent work on problems
  • Oct 29 Monday: Jaehoon Kim
  • T. Luczak and S. Thomasse: Coloring dense graphs via VC-dimension. and P. Allen, J. Bottcher, S. Griffiths, Y. Kohayakawa, and R. Morris: Chromatic thresholds of graphs. IV.

  • Oct 31 Wednesday: Michelle Delcourt
  • Basic definitions, introduction to expanders, a few proofs from spectral graph theory. Lecture Notes

  • Nov 2 Friday: Michelle Delcourt
  • Basic definitions, introduction to expanders, a few proofs from spectral graph theory.

  • Nov 5 Monday: Michelle Delcourt
  • Basic definitions, introduction to expanders, a few proofs from spectral graph theory.

  • Nov 7 Wednesday: Jennifer Wise
  • J. A. Grytczuk, H. A. Kierstead, and P. Prałat, On-line Ramsey numbers for paths and stars, Discrete Mathematics and Theoretical Computer Science 10 (2003), no. 3, pp. 63–74.

  • Nov 9 Friday: Sarah Loeb
  • Alon, N.; Tuza, Zs.; and Voigt, M.: Choosability and fractional chromatic numbers. Discrete Math. 165/166 (1997), 31-38.

  • Nov 12 Monday: McDonald, Daniel Cooper
  • M. Krivelevich and B. Sudakov, The phase transition in random graphs - a simple proof, Random Structures and Algorithms, to appear

  • Nov 14 Wednesday: Paul Horn
  • Density Jumps in multigraphs.

  • Nov 16 Friday: Thomas Mahoney
  • On-line sum choosability

  • Nov X: Maryam Sharifzadeh
  • Rodl and Dellamonica: Something.

  • Nov: Santana, Michael L
  • H. Huang and B. Sudakov, A counterexample to the Alon-Saks-Seymour conjecture and related problems, Combinatorica 32 (2012), 205-219.

    Unassigned papers, to be presented:

    2. Disproving the Neighborhood Conjecture by Heidi Gebauer (see Arxiv)

    3. M. Krivelevich and B. Sudakov, The phase transition in random graphs - a simple proof, Random Structures and Algorithms, to appear. http://www.math.ucla.edu/~bsudakov/papers.html

    4. Dvir, Zeev On the size of Kakeya sets in finite fields. J. Amer. Math. Soc. 22 (2009), no. 4, 1093–1097.

    5. Moser, Robin A. A constructive proof of the Lovász local lemma. STOC'09—Proceedings of the 2009 ACM International Symposium on Theory of Computing, 343–350, ACM, New York, 2009 or Moser, Robin A.; Tardos, Gábor A constructive proof of the general Lovász local lemma. J. ACM 57 (2010), no. 2, Art. 11, 15 pp.

    6. Guy Moshkovitz, Asaf Shapira: Exact Bounds for Some Hypergraph Saturation Problems, manuscript.