On January 15, 2020, Ben Lund from Princeton University gave a talk about a generalization of the Kakeya conjecture posed by Ellenberg, Oberlin, and Tao. The title of his talk was “Furstenberg sets over finite fields“. He is visiting the IBS discrete mathematics group until January 21, Tuesday.

## Sanjeeb Dash gave a talk on the integer programming approach to the interpretable machine learning at the discrete math seminar

On January 14, 2020, Sanjeeb Dash from IBM T. J. Watson Research presented a talk on the integer programming formulation for the problem arising from the interpretable machine learning. The title of his talk was “Boolean decision rules via column generation“. He is visiting IBS Discrete Mathematics Group until the end of this week.

## Jaiung Jun (전재웅) presented a talk on the Hall algebra of the category of matroids at the discrete math seminar

On December 26, Thursday, Jaiung Jun (전재웅) from SUNY New Paltz gave a talk at the discrete math seminar held at KAIST. The title of his talk was “The Hall algebra of the category of matroids“.

## Attila Joó gave a talk on the partition of a set into bases of finitary matroids and cofinitary matroids at the discrete math seminar

On December 19, 2019, Attila Joó from University of Hamburg presented a talk on the partitioning of the ground set into bases of finitary and cofinitary matroids at the discrete math seminar. The title of his talk was “Base partition for finitary-cofinitary matroid families”.

## Hong Liu gave a talk on the conjecture of Mader about the topological minors in C4-free graphs at the discrete math seminar

On December 12, 2019, Hong Liu from University of Warwick gave a talk on the resolution of the conjecture of Mader on the existence of a complete topological minor under the condition of average degree for C4-free graphs at the discrete math seminar held at KAIST. The title of his talk was “A proof of Mader’s conjecture on large clique subdivisions in $C_4$-free graphs“.

## Jakub Gajarský gave a talk on the class of graphs of structurally bounded expansion at the discrete math seminar

On December 10, 2019, Jakub Gajarský from Technische Universität Berlin presented a talk on the class of graphs of structurally bounded expansion and its relationship to the low shrubdepth covers. The title of his talk was “First-order interpretations of bounded expansion classes“.

## Frédéric Meunier gave a talk about new bounds on orthogonality dimension of graphs at the discrete math seminar

On November 21, 2019, Frédéric Meunier from École Nationale des Ponts et Chaussées, Paris presented a talk on the orthogonal representations and the orthogonality dimension of graphs at the discrete math seminar. The title of his talk was “Topological bounds for graph representations over any field“.

## Ruth Luo gave a talk on the induced Turán-type problems for hypergraphs at the discrete math seminar

On November 19, 2019, Ruth Luo from University of California San Diego gave a talk on the Turán-type results on r-uniform hypergraphs without a certain structure called an induced Berge-F. The title of her talk was “Induced Turán problems for hypergraphs“. She is visiting IBS discrete mathematics group until November 22.

## Tony Huynh gave a talk on the maximum weight stable set problem on graphs with bounded number of disjoint odd cycles at the Discrete Math Seminar

On November 12, Tony Huynh from Monash University gave a talk on the maximum weight stable set problem on graphs with bounded odd cycle packing number. The title of his talk was “Stable sets in graphs with bounded odd cycle packing number“.

## Pascal Gollin gave a talk on the existence of a decomposition of an infinite graph into spanning trees at the discrete math seminar

On October 29, 2019, Pascal Gollin from IBS discrete mathematics group gave a talk on the existence of a decomposition of an infinite graph into spanning trees in terms of the existence of packing and covering of spanning trees at the discrete math seminar. The title of his talk was “A Cantor-Bernstein-type theorem for spanning trees in infinite graphs“.