On December 6, 2022, Giannos Stamoulis from Université de Montpellier gave at the Discrete Math Seminar on a fixed-parameter tractable algorithm for the model checking for the first-order logic extended with disjoint paths predicates in H-minor-free graphs. The title of his talk was “Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes“.
Seonghyuk Im (임성혁) gave a talk on the resolution of the Elliott-Rödl conjecture on embedding hypertrees in a Steiner triple system at the Discrete Math Seminar
On November 22, 2022, Seonghyuk Im (임성혁) from KAIST and the IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on the resolution of the Elliott-Rödl conjecture on embedding hypertrees in a Steiner triple system . The title of his talk was “A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems.”
Sebastian Wiederrecht gave a talk on the structure of graphs without certain matching minors and its applications in counting perfect matchings and computing permanents at the Discrete Math Seminar
On November 15, 2022, Sebastian Wiederrecht from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on the structure of graphs without certain matching minors and its applications in counting perfect matchings and computing permanent. The title of his talk was “Excluding single-crossing matching minors in bipartite graphs“.
Hugo Jacob gave an online talk on the parameterized algorithm to approximate the tree-partition-width of graphs at the Virtual Discrete Math Colloquium
On November 9, 2022, Hugo Jacob from the ENS Paris-Saclay gave an online talk at the Virtual Discrete Math Colloquium on the parameterized algorithm to approximate the tree-partition-width of graphs at the Virtual Discrete Math Colloquium. The title of his talk was “On the parameterized complexity of computing tree-partitions“.
Jungho Ahn (안정호) gave a talk at the Discrete Math Seminar on the almost linear kernel for packing and covering problems on nowhere dense classes of graphs
On November 8, 2022, Jungho Ahn (안정호) from KAIST and the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on a unified framework to create a polynomial-time preprocessing algorithm (kernel) for various packing and covering problems reducing the input instance to an equivalent instance of almost linear size on nowhere dense classes of graphs. The title of his talk was “Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes“.
Florent Koechlin gave a talk on properties of uniformly chosen random expressions at the Discrete Math Seminar
On October 18, 2022, Florent Koechlin from LORIA, INRIA, France gave a talk at the Discrete Math Seminar on the reducibility of uniformly random expressions. The title of his talk was “Uniform random expressions lack expressivity“.
Nika Salia gave a talk on the maximum number of bicliques in a graph without an even cycle of a fixed length at the Discrete Math Seminar
On October 11, 2022, Nika Salia from the IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on the maximum number of bicliques in a graph without an even cycle of a fixed length at the Discrete Math Seminar. The title of his talk was “Exact results for generalized extremal problems forbidding an even cycle“.
Zixiang Xu (徐子翔) gave a talk on Turán numbers of bipartite graphs at the Discrete Math Seminar
On October 4, 2022, Zixiang Xu (徐子翔) from the IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on the Turán numbers of bipartite graphs and recent approaches. The title of his talk was “On the degenerate Turán problems“.
Santiago Guzmán-Pro gave an online talk on characterizing hereditary graph classes definable by forbidden orientations at the Virtual Discrete Math Colloquium
On September 29, 2022, Santiago Guzmán-Pro from the Universidad Nacional Autónoma de México (UNAM), Mexico gave an online talk on characterizing hereditary graph classes definable by forbidden orientations at the Virtual Discrete Math Colloquium. The title of his talk was “Local expressions of graphs classes“.
Alexander Clifton gave a talk on the existence of a monochromatic increasing sequence with all gaps in a fixed set in any coloring of the set of positive integers at the Discrete Math Seminar
On September 27, 2022, Alexander Clifton from the IBS Discrete Mathematics Group gave a talk on the existence of a monochromatic increasing sequence with all gaps in a fixed set in any coloring of the set of positive integers at the Discrete Math Seminar. The title of his talk was “Ramsey Theory for Diffsequences“.











