seminar Archives - Page 27 of 34 - Discrete Mathematics Group

September 22, 2020July 6, 2024

Jinha Kim (김진하) gave a talk on her work on the collapsibility of the non-cover complexes of graphs at the Discrete Math Seminar

On September 22, 2020, Jinha Kim (김진하) from the IBS Discrete Mathematics Group presented her recent work on the collapsibility of the non-cover complexes of graphs at the Discrete Math Seminar. The non-cover complex of a graph is a simplicial complex consisting of subsets of vertices not covering all edges. The title of her talk was “Collapsibility of Non-Cover Complexes of Graphs“.

September 17, 2020July 6, 2024

Luke Postle gave a talk on the very recent improvement towards Hadwiger’s conjecture at the Virtual Discrete Math Colloquium

On September 17, 2020, Luke Postle from the University of Waterloo gave an online talk about his recent (another) breakthrough towards Hadwiger’s conjecture. The title of his talk was “Further progress towards Hadwiger’s conjecture“.

September 15, 2020July 6, 2024

Debsoumya Chakraborti gave a talk on the problem of maximizing the number of cliques in a graph of small maximum degree at the Discrete Math Seminar

On September 15, 2020, Debsoumya Chakraborti from the IBS Discrete Mathematics Group presented a talk on the extremal problem on the number of cliques in a graph of small maximum degree with a fixed number of edges. The title of his talk was “Maximum number of cliques in a graph with bounded maximum degree“.

September 12, 2020July 6, 2024

Sebastian Siebertz gave a talk on recent approaches to combine model theoretic and graph theoretic tools to derive structural and algorithmic results for classes of (finite) graphs at the Virtual Discrete Math Colloquium

On September 10, 2020, Sebastian Siebertz from University of Bremen gave an online talk about recent attempts to combine the model theory to the theory of dense graphs at the Virtual Discrete Math Colloquium. The title of his talk was “Rank-width meets stability“.

September 8, 2020July 6, 2024

Rutger Campbell gave a talk on the real representability of matroids at the Discrete Math Seminar

On September 8, 2020, Rutger Campbell from the IBS Discrete Mathematics Group presented a talk on various results on the real representability of matroids at the Discrete Math Seminar. The title of his talk was “Disasters in abstracting combinatorial properties of linear dependence“.

September 1, 2020July 6, 2024

Junguk Lee (이정욱) from KAIST gave an intensive lecture on the stability and NIP in the model theory at the Discrete Math Seminar for two days

On August 31 and September 1, 2020, Junguk Lee (이정욱) from KAIST gave a 6-hour-long talk on the model theory with the focus on the stability, NIP, and the VC dimension at the Discrete Math Seminar. The title of his talk was “a quick introduction to stability and NIP”. The part 1 “basics” and the part 2 “stability” were coved on August 31, for 1.5 hours each, and the part 3 “NIP” was covered on September 1 for 3 hours (10:30-11:30, 3:00-4:00, 4:10-5:10).

August 25, 2020July 6, 2024

Ben Lund gave a talk on the generalization of Beck’s theorem on the number of incidences between points and lines at the Discrete Math Seminar

On August 25, 2020, Ben Lund from IBS Discrete Mathematics Group presented a talk on his generalization of Beck’s theorem resulting lower bounds on the number of planes spanned by a set of points and its various applications. The title of his talk was “Point-plane incidence bounds“.

August 18, 2020July 6, 2024

Tuan Tran gave a talk on the anti-concentration phenomena at the Discrete Math Seminar

On August 18, 2020, Tuan Tran from IBS Discrete Mathematics Group gave a talk on the anti-concentration phenomena and its consequences to the random matrix theory. The title of his talk is “Anti-concentration phenomena”.

August 12, 2020July 6, 2024

Yunbum Kook (국윤범) gave a talk on finding a small equivalence instance for the minimum edge-cut problem at the Discrete Math Seminar

On August 11, 2020, Yunbum Kook (국윤범) from KAIST presented his work on the existence of a connectivity-c mimicking network, which is a graph preserving the size of all minimum edge-cuts between any partition of a given set of terminals up to a constant c and an efficient algorithm to find one. The title of his talk was “Vertex Sparsification for Edge Connectivity“.

August 5, 2020July 6, 2024

Robert Ganian gave a talk on structural approaches to the integer linear programming at the Virtual Discrete Math Colloquium

On August 5, 2020, Robert Ganian from Technische Universität Wien gave an online talk giving an overview of recent approaches to the integer linear programming based on the structural analysis of graphs associated with the instances at the Virtual Discrete Math Colloquium. The title of his talk was “Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions“.

Category: seminar