seminar Archives - Page 18 of 29 - Discrete Mathematics Group

April 8, 2021April 8, 2021

Michał Pilipczuk gave an online talk on the structural properties of powers of graphs in a class of bounded expansion or in a nowhere dense class at the Virtual Discrete Math Colloquium

On April 7, 2021, Michał Pilipczuk from the University of Warsaw gave an online talk at the Virtual Discrete Math Colloquium on the structural properties of powers of graphs in a fixed class of of graphs of bounded expansion or a fixed nowhere-dense class of graphs. The title of his talk was “Structural properties of powers of sparse graphs“.

April 6, 2021April 6, 2021

Rutger Campbell gave a talk on the hardness of deciding the real representability of complex-representable orientable matroids at the Discrete Math Seminar

On April 6, 2021, Rutger Campbell from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on the difficulty of deciding whether a matroid given by the independence oracle is representable over the reals even if the matroid is representable over the complex field and is orientable. The title of his talk was “Matroid orientability and representability“.

April 2, 2021April 2, 2021

Sophie Spirkl gave an online talk on pure pairs in an ordered graph at the Virtual Discrete Math Colloquium

On April 1, 2021, Sophie Spirkl from the University of Waterloo gave an online talk on pure pairs in an ordered graph at the Virtual Discrete Math Colloquium. The title of her talk was “Pure pairs in ordered graphs“.

March 31, 2021March 31, 2021

Casey Tompkins gave a talk on the maximum number of edges in 3-uniform hypergraphs without Berge cycles of length 4 at the Discrete Math Seminar

On March 30, 2021, Casey Tompkins from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on an upper bound for the maximum number of edges in a 3-uniform hypergraph having no Berge cycles of length 4. The title of his talk was “3-uniform hypergraphs avoiding a cycle of length four“.

March 24, 2021March 24, 2021

Édouard Bonnet gave an online talk on ordered binary structures of bounded twin-width at the Virtual Discrete Math Colloquium

On March 24, 2021, Édouard Bonnet from the LIP, CNRS gave an online talk at the Virtual Discrete Math Colloquium on several characterizations of classes of ordered binary structures of bounded twin-width. The title of his talk was “Twin-width and ordered binary structures“.

March 22, 2021March 22, 2021

Hong Liu gave a talk on the extremal problem of finding nested cycles with no geometric crossing at the Discrete Math Seminar

On March 22, 2021 at the Discrete Math Seminar, Hong Liu (刘鸿) from the University of Warwick gave a talk on the extremal problem of having nested cycles with no geometric crossing by using the sublinear expanders. The title of his talk was “Nested cycles with no geometric crossing“.

March 17, 2021March 17, 2021

Yixin Cao gave an online talk on the algorithm for recognizing interval graphs with only four LexBFS searches at the Virtual Discrete Math Colloquium

On March 17, 2021, at the Virtual Discrete Math Colloquium, Yixin Cao (操宜新) from Hong Kong Polytechnic University gave an online talk on the recognition algorithm for interval graphs by using 4 graph searchers with an improved presentation compared to the version of Li and Wu. The title of his talk was “Recognizing (unit) interval graphs by zigzag graph searches“.

March 16, 2021March 16, 2021

Se-Young Yun (윤세영) presented his work on online recommendation systems at the Discrete Math Seminar

On March 16, 2021, at the Discrete Math Seminar, Se-Young Yun (윤세영) from KAIST gave a talk on a theoretical analysis of recommendation systems in an online setting, not only proving a lower bound on the regret but also providing an algorithm almost matching these lower bounds. The title of his talk was “Regret in Online Recommendation Systems“.

March 9, 2021March 9, 2021

Debsoumya Chakraborti presented two results on the graph saturation problems at the Discrete Math Seminar

On March 9, 2021, Debsoumya Chakraborti from the IBS Discrete Mathematics Group gave a talk explaining his two results on the graph saturation problem jointly with Po-Shen Loh. The title of his talk was “Some classical problems in graph saturation“.

March 2, 2021March 2, 2021

Kevin Hendrey gave a talk on the theorem on the half-integral Erdős-Posa property of cycles in a graph with edge labelling by multiple abelian groups at the Discrete Math Seminar

On March 2, 2021, Kevin Hendrey from the IBS Discrete Mathematics Group presented his recent result with Pascal Gollin, Ken-ichi Kawarabayashi, O-joung Kwon, and Sang-il Oum on the half-integral Erdős-Posa property of cycles in a graph with edge labelling by multiple abelian groups at the Discrete Math Seminar. The title of his talk was “A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups“.

Category: seminar