Name: 2022 Combinatorics Workshop
Start: 2022-09-30T13:00:00+09:00
End: 2022-10-01T18:00:00+09:00
Location: No location set

2022 Combinatorics Workshop

from Friday, 30 September 2022 (13:00) to Saturday, 1 October 2022 (18:00)

Friday, 30 September 2022

13:00 Registration
Registration
13:00 - 13:20

13:20 Opening
Opening
13:20 - 13:30
13:30
13:30 - 15:15
Contributions

13:30 New connections between numerical semigroups and integer partitions - Hayan Nam (Duksung Women’s University)

14:30 Intersective sets over abelian groups - Zixiang Xu (IBS ECOPRO)

14:55 Reconfiguration of homomorphism extensions - Mark Siggers (Kyungpook National University)
15:15 Coffee Break
Coffee Break
15:15 - 15:40
15:40
15:40 - 18:00
Contributions

15:45 Introduction to DP-coloring - Seog-Jin Kim (Konkuk University)

16:45 Reconstruction and Edge Reconstruction of Triangle-free Graphs - Alexander Clifton (IBS DIMAG)

17:10 On Entropy of graphs - Stijn Cambie

17:35 A unified proof of conjectures on cycle lengths in graphs - Jun Gao (ECOPRO in IBS)
18:00 Banquet
Banquet
18:00 - 20:00
Saturday, 1 October 2022
10:00
10:00 - 12:05
Contributions

10:00 Some new results on geometric transversals - Andreas Holmsen (KAIST)

11:20 Strong Erd\H{o}s-Hajnal property on chordal graphs and its variants - Minho Cho (KAIST)

11:45 Stability version of Dirac's theorem and its applications for generalized Turán problems - Nika Salia (IBS Extremal Combinatorics and Probability Group)
12:05 Photo
Photo
12:05 - 12:30

12:30 Lunch
Lunch
12:30 - 14:15
14:15
14:15 - 16:00
Contributions

14:15 Chromatic quasisymmetric functions and linked rook placements - Seung Jin Lee (Seoul National University)

15:15 $(q,t)$-analogues of $n!$ and $(n+1)^{n-1}$ - Jaeseong Oh (Korea Institute for Advanced Study)

15:40 The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs - Jungho Ahn (KAIST & IBS DIMAG)
16:00 Closing
Closing
16:00 - 16:10