On July 29, 2020, Akanksha Agrawal from Ben-Gurion University of the Negev gave the second talk of the online seminar series called the Virtual Discrete Math Colloquium. The title of her talk was “Polynomial Kernel for Interval Vertex Deletion“.
On July 24, 2020, Kevin Hendrey of IBS Discrete Mathematics Group was awarded 2020 Vice-Chancellor’s Commendation for Thesis Excellence from Monash University. This award is to recognize and reward outstanding doctoral and research master’s thesis excellence. Congratulations! Here is the link to the award booklet.
Due to the COVID-19 pandemic, we decided to start a new series of talks given online under the name “Virtual Discrete Math Colloquium” so that we can invite speakers abroad online. On July 22, 2020, its first talk was given by Paloma T. Lima from University of Bergen, Norway. She talked about the problem of deciding whether a given input graph G is a square of some graph H with some restrictions on H. The title of her talk was “Graph Square Roots of Small Distance from Degree One 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“.