seminar Archives - Page 13 of 36 - Discrete Mathematics Group

May 1, 2023July 6, 2024

Hyunwoo Lee (이현우) gave a talk on partitioning a graph into induced subgraphs each having a subdivision of a fixed graph as a subgraph at the Discrete Math Seminar

On April 25, 2023, Hyunwoo Lee (이현우) from KAIST and IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar about the minimum degree condition to have a partition of a graph into induced subgraphs each having a subdivision of a fixed graph as a subgraph. The title of his talk was “On perfect subdivision tilings.”

April 13, 2023July 16, 2025

James Davies gave a talk on the 𝜒-boundedness and the strong Erdős-Hajnal property of proper pivot-minor-closed classes of graphs at the Discrete Math Seminar

On April 11, 2023, James Davies from the University of Cambridge gave a talk at the Discrete Math Seminar on his two theorems stating that proper pivot-minor-closed classes of graphs are 𝜒-bounded and have the strong Erdős-Hajnal property. The title of his talk is “two structural results for pivot-minors.”

April 6, 2023July 6, 2024

István Tomon gave a talk on the intersection graph of axis-parallel boxes at the Discrete Math Seminar

On April 4, 2023, István Tomon from Umeå universitet, Sweden gave a talk at the Discrete Math Seminar on the intersection graph of axis-parallel boxes at the Discrete Math Seminar. The title of his talk was “Configurations of boxes.”

March 31, 2023July 6, 2024

Tianchi Yang gave a talk on the maximum number of edges in k-critical graphs at the Discrete Math Seminar

On March 28, 2023, Tianchi Yang from the National University of Singapore gave a talk at the Discrete Math Seminar about the maximum number of edges in an n-vertex k-critical graph. The title of his talk was “On the maximum number of edges in k-critical graphs.”

March 22, 2023July 6, 2024

Younjin Kim (김연진) gave a talk on the overview of her results in extremal combinatorics at the Discrete Math Seminar

On March 21, 2023, Younjin Kim (김연진) from the IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on the overview of her results in extremal combinatorics. The title of her talk was “Problems on Extremal Combinatorics.”

March 21, 2023July 7, 2024

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.”

March 15, 2023July 6, 2024

Stijn Cambie gave a talk on recent developments regarding the union-closed sets conjecture at the Discrete Math Seminar

On March 14, 2023, Stijn Cambie from the IBS Extremal Probability and Combinatorics Group gave a talk at the Discrete Math Seminar on recent developments regarding the union-closed sets conjecture initiated by Justin Gilmer. The title of his talk was “Recent progress on the Union-closed conjecture and related“.

March 9, 2023July 6, 2024

Eunjin Oh (오은진) gave a talk on a faster algorithm to solve the planar disjoint-paths problem at the Discrete Math Seminar

On March 7, 2023, Eunjin Oh (오은진) from POSTECH gave a talk at the Discrete Math Seminar on a new faster algorithm for solving the disjoint paths problem on planar graphs. The title of her talk was “Parameterized algorithms for the planar disjoint paths problem“.

March 1, 2023July 6, 2024

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“.

February 22, 2023July 6, 2024

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“.

Category: seminar