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

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

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