기초과학연구원 이산수학그룹
On July 21, 2020, Ilkyoo Choi (최일규) from Hankuk University of Foreign Studies gave a talk on the flexibility of planar graphs, a concept related to extending a a precoloring at the Discrete Math Seminar. The title of his talk was “Flexibility of Planar Graphs“.
On July 14, 2020, Casey Tompkins from IBS Discrete Mathematics Group gave a talk on inverse Turán problems at the Discrete Math Seminar. The goal is for a fixed graph H and an integer k to find the minimum number of edges of a graph G such that that every subgraph of G with at least k edges has a subgraph isomorphic to H. The title of his talk is “Inverse Turán Problems“.
The IBS discrete mathematics group welcomes Yunbum Kook (국윤범). He is a visiting student from July 2020 to August 2020 and is currently an undergraduate student at KAIST.
On July 7, 2020, Seog-jin Kim (김석진) from Konkuk University presented his work on the online DP-coloring of graphs, a common generalization of the online coloring and the DP coloring, both generalizing the list coloring of graphs. The title of his talk was “Online DP-coloring of graphs“. He will stay at the IBS discrete mathematics group until the end of this week.
On June 30, 2020, Dennis Wong from SUNY Korea gave a talk on algorithms to generate Gray codes and universal cycles for weak orders at the Discrete Math Seminar. At the end of the talk, his student, Fabio Calero from SUNY Korea, gave a sketch about another work on Gray codes for ballot sequences. The title of his talk is “Generating Gray codes and universal cycles for weak orders“.
On June 23, 2020, Jaehoon Kim (김재훈) from KAIST presented his work with Padraig Condon, Alberto Espuny Diaz, Daniela Kühn and Deryk Osthus on a resilience version of Pósa’s theorem regarding a sufficient condition on the degree sequence for a graph to have a Hamiltonian cycle at the Discrete Math Seminar. The title of his talk is “A resilience version of Pósa’s theorem“.
On June 16, 2020, Andreas Holmsen from KAIST presented his recent work with Xavier Goaoc and Zuzana Patáková on generalizing the fractional Halley theorem under very weak topological assumptions. The title of his talk was “Fractional Helly and topological complexity“.
On June 9, 2020, Jiseung Kim (김지승) from KIAS presented a talk on some aspects of cryptography, including his recent work “Adventures in Crypto Dark Matter: Attacks, Fixes, and Analysis of weak PRF” jointly with Jung Hee Cheon, Wonhee Cho, and Jeong Han Kim. The title of his talk was “Hardness and concrete security in cryptography“.
On June 2, 2020, Huy-Tung Nguyen from KAIST gave a talk on the graph parameter called the average cut-rank of a graph. The title of his talk is “The average cut-rank of graphs“.
On May 26, 2020, Hong Liu from University of Warwick presented a talk on his recent work describing approximate structures of an n-vertex m-edge graph minimizing the number of cliques of size k. The title of his talk was “Asymptotic Structure for the Clique Density Theorem”.