Program

Locations

  • Talks and Registration: Geomungo C Hall, 2nd floor
  • Coffee Break: Gayageum C Hall, 2nd floor

August 4 Monady

17:00-19:00 Registration
20:30-21:30 Registration

August 5 Tuesday

9:00-10:00 László Lovász (Hungarian Academy of Sciences): Analytic methods in extremal graph theory

10:00-10:20 Coffee Break

10:20-11:00 Balázs Szegedy (Alfréd Rényi Institute): Relative entropy and Sidorenko’s conjecture
11:00-11:40 Hamed Hatami (McGill University): Bounds on the sum of L1 influences
11:40-12:20 Xuding Zhu (Zhejiang Normal University): Chromatic Ramsey number and circular chromatic Ramsey number of graphs

12:20-14:30 Lunch

14:30-15:10 Mihyun Kang (Technische Universität Graz): Symmetries of triangulations
15:10-15:50 Gábor Tardos (Alfréd Rényi Institute / Simon Fraser University): On the communication complexity of sparse set disjointness and exists-equal problems

15:50-16:20 Coffee Break

16:20-18:00 Contributed talks

  • 16:20-16:45 Maya Stein: Monochromatic cycles in edge coloured complete or complete multipartite graphs
  • 16:45-17:10 Suil O: Edge-connectivity in regular multi graphs from an eigenvalue
  • 17:10-17:35 Boram Park: Bipartite graphs whose squares are not chromatic-choosable
  • 17:35-18:00 Mark Siggers: Infinite tree dualities

August 6 Wednesday

9:00-10:00 Bojan Mohar (Simon Fraser University / IMFM Ljubljana): Rooted K2,4 minors and wye-delta reducibility

10:00-10:20 Coffee Break

10:20-11:00 Jaroslav Nešetřil (Charles University): Sparse dense dichotomy with applications
11:00-11:40 Daniel Král’ (University of Warwick): Limits of discrete structures
11:40-12:20 Kenta Ozeki (National Institute of Informatics): A generalization of the (g,f)-factor theorem using set functions

12:20-14:30 Lunch

14:30-15:10 Douglas B. West (Zhejiang Normal University / UIUC): Minimum degree and dominating paths
15:10-15:50 Prasad Tetali (Georgia Tech): Ricci curvature in graphs?

15:50-16:20 Coffee Break

16:20-18:00 Contributed talks

  • 16:20-16:45 Chun-Hung Liu: Well-quasi-ordering graphs by the topological minor relation
  • 16:45-17:10 Ilkyoo Choi: Choosability of toroidal graphs with forbidden structures
  • 17:10-17:35 Younjin Kim: On problems and conjectures related to Erdős-Ko-Rado theorem
  • 17:35-18:00 Joonkyung Lee: A randomized algorithm generating graph homomorphisms, entropy and Sidorenko’s conjecture

August 7 Thursday

9:00-10:00 Alexandr V. Kostochka (UIUC / Sobolev Institute of Mathematics): Proving that critical graphs are dense

10:00-10:20 Coffee Break

10:20-11:00 Penny Haxell (University of Waterloo): Extremal graphs for connectedness
11:00-11:40 Paul Wollan (University of Rome): When are digraphs well-quasi-ordered under taking minors?
11:40-12:20 David R. Wood (Monash University): Forcing a sparse minor

12:20-14:30 Lunch & Free Afternoon (A group excursion)

19:00 Banquet (Geomungo A Hall)

August 8 Friday

9:00-10:00 Benny Sudakov (ETH): Grid Ramsey problem and related questions

10:00-10:20 Coffee Break

10:20-11:00 Peter Keevash (University of Oxford): The existence of designs
11:00-11:40 Choongbum Lee (MIT): Robustness of graphs – case study: Dirac’s theorem 
11:40-12:20 Po-Shen Loh (Carnegie Mellon University): Diameter critical graphs

12:20-14:30 Lunch

14:30-15:10 Van Vu (Yale): A simple spectral algorithm for finding a hidden partition in a random graph
15:10-15:50 Zdeněk Dvořák (Charles University): Sublinear separators, fragility and subexponential expansion

15:50-16:20 Coffee Break

16:20-18:00 Contributed talks

  • 16:20-16:45 Sang June Lee: On the number of Bh-sets
  • 16:45-17:10 László M. Lovász: The height of the tower in Szemerédi’s regular lemma
  • 17:10-17:35 Rinovia Simanjuntak: Strong oriented graphs with largest directed metric dimensions
  • 17:35-18:00 O-joung Kwon: Linear rank-width of distance-hereditary graphs

August 9 Saturday

9:00-9:40 Jacob Fox (MIT) Extremal graph theory, geometry, and algebra
9:40-10:20 David Conlon (University of Oxford): Cycle packing

10:20-10:40 Coffee Break

10:40-11:55 Contributed talks

  • 10:40-11:05 Jaehoon Kim: Saturation number of Ramsey-minimal graphs for matching
  • 11:05-11:30 Novi Herawati Bong: Extremal graphs of girth 5
  • 11:30-11:55 Spencer Backman: Chip-firing via partial graph orientations and the combinatorial Riemann-Roch theorem