Paul Seymour gave an online talk on the size of a clique or an independent set in an H-free graph at the Virtual Discrete Math Colloquium

On March 16, 2023, Paul Seymour from Princeton University gave an online talk at the Virtual Discrete Math Colloquium on the existence of a clique or an independent set of size at least $2^{c\sqrt{\log n \log \log n}}$ in an $H$-free graph. The title of his talk was “A loglog step towards the Erdős-Hajnal conjecture.”

Maya Sankar gave a talk about an extremal problem on 2-dimensional simplicial complexes analogous to Mader’s theorem on graphs without a subdivision of a fixed complete graph at the Discrete Math Seminar

On February 28, 2023, Maya Sankar from Stanford University gave a talk at the Discrete Math Seminar about an extremal problem on 2-dimensional simplicial complexes analogous to Mader’s theorem on the number of edges in a graph without a subdivision of a fixed complete graph. The title of her talk was “The Turán Numbers of Homeomorphs“.

Meike Hatzel gave a talk on the parameterized complexity of finding a vertex cut of small size separating three pairs of terminals on a directed graph at the Discrete Math Seminar

On February 21, 2023, Meike Hatzel from the National Institute of Informatics in Tokyo gave a talk at the Discrete Math Seminar on the parameterized complexity of the Directed Multicut problem with three pairs of terminals, which is to find a vertex cut of size at most k separating three pairs of terminals. The title of her talk was “Fixed-Parameter Tractability of Directed Multicut with Three Terminal Pairs Parametrised by the Size of the Cutset: Twin-Width Meets Flow-Augmentation“.

Raphael Steiner gave a talk on a stronger version of Hadwiger’s conjecture at the Discrete Math Seminar

On February 14, 2023, Raphael Steiner from ETH Zürich gave a talk at the Discrete Math Seminar on a stronger version of Hadwiger’s conjecture, which finds a clique minor in which one of its branch set is a singleton. The title of his talk was “Strengthening Hadwiger’s conjecture for 4- and 5-chromatic graphs“. He is currently visiting the IBS discrete mathematics group for 2 weeks.

Benjamin Bergougnoux gave an online talk on proving tight lower bounds for the running time of various problems parameterized by rank-width at the Virtual Discrete Math Colloquium

On February 1, 2023, Benjamin Bergougnoux from the University of Warsaw gave an online talk at the Virtual Discrete Math Colloquium about proving tight lower bounds for the running time of various problems parameterized by rank-width. The title of his talk was “Tight Lower Bounds for Problems Parameterized by Rank-width“.

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.