Péter Pál Pach gave a talk on the maximum set of positive integers that avoids having any product of k elements equal to a d-th power at the Discrete Math Seminar

On November 25, 2025, Péter Pál Pach from the Budapest University of Technology and Economics gave a talk at the Discrete Math Seminar on the maximum set of positive integers that avoids having any product of k elements equal to a d-th power. The title of his talk was “Product representation of perfect cubes“.

Tim Hartmann and Ahmed Ghazy gave a talk on continuous graphs—a model obtained by replacing each edge of a graph with a unit interval to form a metric space, enabling continuous analogues of classical graph problems at the Discrete Math Seminar

On November 4, 2025, Tim Hartmann and Ahemed Ghazy from CISPA Helmholtz Center for Information Security in Germany gave a talk at the Discrete Math Seminar on continuous graphs—a model obtained by replacing each edge of a graph with a unit interval to form a metric space, enabling continuous analogues of classical graph problems. The title of their talk was “Continuous Graphs – An Overview and a Coloring Problem“.

Jakob Greilhuber gave a talk on the problem of deleting a small set of vertices to make every component small at the Discrete Math Seminar

On October 28, 2025, Jakob Greilhuber from the CISPA Helmholtz Center for Information Security gave a talk at the Discrete Math Seminar on the parameterized complexity of the problem of deleting k vertices to make every component small. The title of his talk was “A Dividing Line for Structural Kernelization of Component Order Connectivity via Distance to Bounded Pathwidth“.

Ilkyoo Choi (최일규) gave a talk on the average degree of list-color-critical graphs and DP-color-critical graphs at the Discrete Math Seminar

On October 14, 2025, Ilkyoo Choi (최일규) from Hankuk University of Foreign Studies and IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on the average degree of list-color-critical graphs and DP-color-critical graphs. The title of his talk was “An improved lower bound on the number of edges in list critical graphs via DP coloring“.

Mujin Choi (최무진) gave a talk on unavoidable induced minors in graphs of large tree-independence number without a fixed star induced subgraph

On September 16, 2025, Mujin Choi (최무진) from KAIST and the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on unavoidable induced minors in graphs of large tree-independence number without a fixed induced star. The title of his talk was “Excluding ladder and wheel as induced minor in graphs without induced stars“.

IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.