List of Speakers:

  • Aug 25 Monday: Hong Liu:
  • Kostochka-Sudakov-Verstraete: Cycles in triangle-free graphs with large chromatic number

  • Aug 27 Wednesday: Hong Liu:
  • Kostochka-Sudakov-Verstraete: Cycles in triangle-free graphs with large chromatic number

  • Aug 29 Friday: Michael Santana: Some Problems and Results on the Strong Chromatic Index of Graphs


  • Sept 3 Wednesday: Michelle Delcourt: Some Problems and Results on the Kneser Graph


  • Sept 5 Friday: Michelle Delcourt: Some Problems and Results on the Kneser Graph II


  • Sept 8 Monday: M Sara Loeb: Planar Graphs Without Cycles of Specific Lengths by G. Fijavz, M. Juvan, B. Mohar, and R. Skrekovski.


  • Sept 10 Wednesday: Derrek Yager: On the list packing of graphs.


  • Sept 12 Friday: Jennifer Wise: Domination game: Effect of edge- and vertex-removal Bo\v{s}tjan Bre\v{s}ar, Paul Dorbec, Sandi Klav\v{z}ar, Ga\v{s}per Ko\v{s}mrlj


  • Sept 15 Monday: Andrew McConwey: On the list packing of graphs II.


  • Sept 17 Wednesday: Maryam Sharifzadeh: Counting maximal antichains and independent sets. Liviu Ilinca, Jeff Kahn.


  • Sept 19 Friday: Anton Bernstein: 3-regular subgraphs of 4-regular pseudographs.


  • Sept 22 Monday: Sarka Petrickova: Hoppen-Lefmann: 'Edge-coorings avoiding a fixed matching with prescribed color pattern


  • Sept 24 Wednesday: Michelle Delcourt: Most probably intersecting hypergraphs, by Das--Sudakov


  • Sept 26 Friday: George Shakan: Sum of Dilates
  • Sept 29 Monday: Yeager, Elyse Christine: Disjoint Cycles and a Question of Dirac.


  • October 1 Wednesday: Michael Santana: Rodl, Rucinski, and Szemeredi "A Dirac-Type Theorem for 3-Uniform Hypergraphs


  • October 3 Friday: Zsolt Adam Wagner: Maximum-size Antichains in Random Sets; Authors: M. Collares Neto, R. Morris
  • October 6 Monday: Michelle Delcourt: Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees by Marcus, Spielman, and Srivastava


  • October 8 Wednesday: Michelle Delcourt: Interlacing Families II: Bipartite Ramanujan Graphs of All Degrees by Marcus, Spielman, and Srivastava


  • October 10 Friday: Michelle Delcourt: Interlacing Families III: Bipartite Ramanujan Graphs of All Degrees by Marcus, Spielman, and Srivastava


  • Octobe 13 Monday: Anton Bernshteyn: On the Moser-Tardos Local lemma


  • Octobe 15 Wednesday: Anton Bernshteyn: On the Local Action lemma and the entropy compression method


  • Octobe 17 Friday: Anton Bernshteyn: On the Local Action lemma and the entropy compression method II


  • October 20 Monday: Andrew McConway:
  • Coloring triple systems with local conditions, by Dhruv Mubayi

  • October 22 Wednesday: Choongbum Lee: On the number of cliques in minor-free graphs:


  • October 24 Friday: Hong Liu:
  • Montgomery: How to embed bounded degree spanning tree into sparse random graph?

  • October 27 Monday: Yunfang Tang:
  • Total weight choosability of cone graphs by Yunfang Tang, Xuding Zhu and Tsai-Lien Wong.

  • October 29 Wednesday: Sara Loeb: Star coloring high girth planar graphs" by Craig Timmons:


  • October 31 Friday: Gelasio Salazar: Some open problems in topological graph theory


  • November 3 Monday: Maryam Sharifzadeh: Counting sumsets and sum-free sets,I. by Green and Ruzsa


  • November 5 Wednesday: Maryam Sharifzadeh: Counting sumsets and sum-free sets,I. by Green and Ruzsa; II


  • November 7 Friday: Imre Leader: `Higher Order Tournaments'.


  • November 10 Monday: Hong Liu:
  • N. Alon, Large sets in finite fields are sumsets, J. Number Theory 126 (2007), 110-118.

  • November 12 Wednesday: George Shakan: Sum of Dilates II.
  • November 14 Friday: Zsolt Adam Wagner: Bollobás, Béla; Brightwell, Graham R.; Leader, Imre The number of 2-SAT functions. Maximum-size Antichains in Random Sets;
  • November 17 Monday: Andrew McConway:
  • Lovász Path Removal conjecture for tournaments. by Kim, Kuhn, and Osthus.

  • November 19 Wednesday: Michael Santana: Tiling 3-uniform hypergraphs with K_4^3 - 2e" by A. Czygrinow, L. DeBiasio, and B. Nagle


  • November 21 Friday: Jennifer Wise: On the difference between chromatic number and dynamic chromatic number of graphs" A. Ahadi, S. Akbari, A. Dehghan, M. Ghanbari.


  • December 1 Monday: Sarka Petrickova:
  • Ordered Ramsey numbers" by Conlon, Fox, Lee, Sudakov I.

  • December 3 Wednesday: Sarka Petrickova:
  • Ordered Ramsey numbers" by Conlon, Fox, Lee, Sudakov II.

    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.