On the Android Phone, we recommend to subscribe the calendar in the Google Calendar. To do so, click “+” after “Other calendars” and click “From URL (URL로 추가)” in the setting and type the following URL.
On May 16, 2019, Xin Zhang (张欣) from Xidian University, China discusses various results on the equitable tree-k-coloring of graphs, a problem of partitioning the vertex set of a graph into vertex-disjoint induced subgraphs having no cycles with almost same size. The title of his talk was “On equitable tree-colorings of graphs”. Xin Zhang is visiting IBS Discrete Mathematics Group from May 15 to May 19.
Sang June Lee (이상준) from Duksung Women’s University presented his recent work on the strong Sidon sets at the Discrete Math Seminar on May 8, 2019. The title of his talk was “On strong Sidon sets of integers”.
Rose McCarty from University of Waterloo presented her recent breakthrough on the polynomially 𝜒-boundedness of circle graphs at the Discrete Math Seminar on April 26, 2019 . The title of her talk was “circle graphs are polynomially chi-bounded.”
Andreas Holmsen from KAIST gave a talk at Discrete Math Seminar on March 12, 2019 under the title “large cliques in hypergraphs with forbidden substructures.” His work extended a result of extremal graph theory due to Gyárfás, Hubenko, and Solymosi, answering a question of Erdős to hypergraphs and has interesting consequences in topological combinatorics and abstract convexity.
DIMAG had its first workshop “2019-1 IBS Workshop on Graph Theory” on February 11 and 12, 2019. There were 6 invited talks — Jeong Han Kim (KIAS), Cory T. Palmer (Univ. of Montana), Martin Balko (Charles Univ.), Dong Yeap Kang (KAIST), Boram Park (Ajou Univ.), and Dániel Gerbner (Alfréd Rényi Institute of Mathematics). We would like to thank all speakers and participants.
The talks are recorded but due to technical problems, only four talks are available online.
2019-02-11 Jeong Han Kim (김정한), Entropy and sorting
2019-02-11 Cory T. Palmer, Generalized Turán problems: Berge hypergraphs
2019-02-11 Martin Balko, Ramsey numbers of edge-ordered graphs
2019-02-12 Boram Park (박보람), Sum-free set problem on integers