On August 1, 2022, Seunghun Lee (이승훈), who is from the Binghamton University, and will be soon at the Hebrew University of Jerusalem, gave a talk at the Discrete Math Seminar on order types realized by a point configuration whose extreme points are cocircular. The title of his talk was “Inscribable order types“.
Jinyoung Park (박진영) gave two talks on the proof of the Kahn-Kalai conjecture at the Discrete Math Seminar
On July 18-19, 2022, Jinyoung Park (박진영) from Stanford University gave two talks on the proof of the Kahn-Kalai conjecture at the Discrete Math Seminar. The title of her talk was “thresholds“.
Kevin Hendrey gave a talk on describing a graph as a subgraph of the strong product of a graph of small tree-width and a small complete graph at the Discrete Math Seminar
On July 11, 2022, Kevin Hendrey from IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on describing a graph as a subgraph of the strong product of a graph of a small tree-width and a small complete graph. The title of his talk was “Product Structure of Graph Classes with Bounded Treewidth“.
Sepehr Hajebi gave an online talk on bounding the tree-width of graphs with forbidden induced subgraphs at the Virtual Discrete Math Colloquium
On July 7, 2022, Sepehr Hajebi from the University of Waterloo gave an online talk at the Virtual Discrete Math Colloquium on bounding the tree-width of graphs with forbidden induced subgraphs. The title of his talk was “Holes, hubs and bounded treewidth“.
Eric Vigoda gave a talk on determining computational phase transitions for approximate counting/sampling by Markov Chain Monte Carlo (MCMC) algorithms at the Discrete Math Seminar
On July 4, 2022, Eric Vigoda from the UC Santa Barbara gave a talk at the Discrete Math Seminar on determining computational phase transitions from the fast mixing to the NP-hardness for approximate counting/sampling by Markov Chain Monte Carlo (MCMC) algorithms. The title of his talk was “Computational phase transition and MCMC algorithms“.
Ben Lund gave a talk on radial projections in a vector space over a finite field at the Discrete Math Seminar
On June 27, 2022, Ben Lund from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on a large set of points with small radial projections in a vector space over a finite field. The title of his talk was “Radial projections in finite space“.
Amadeus Reinald gave a talk on the twin-width of graphs of girth at least 5 without an induced subdivision of $K_{2,3}$ at the Discrete Math Seminar
On June 13, 2022, Amadeus Reinald from the ENS de Lyon and the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar, proving that graphs of girth at least 5 without an induced subdivision of $K_{2,3}$ have bounded twin-width. The title of his talk was “Twin-width and forbidden subdivisions“.
Hongseok Yang (양홍석) gave a talk on how to use symmetries to improve learning with SATNet at the Discrete Math Seminar
On May 30, 2022, Hongseok Yang (양홍석) from KAIST and the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on how to use symmetries to improve learning with SATNet at the Discrete Math Seminar. The title of his talk was “Learning Symmetric Rules with SATNet“.
Sebastian Siebertz gave an online talk on producing a long path by a first-order transduction from a class of graphs of unbounded shrubdepth at the Virtual Discrete Math Colloquium
On May 25, 2022, Sebastian Siebertz from the University of Bremen gave an online talk at the Virtual Discrete Math Colloquim on producing a long path by a first-order transduction from a class of graphs of unbounded shrubdepth. The title of his talk was “Transducing paths in graph classes with unbounded shrubdepth“.
Stijn Cambie gave a talk on the diameter of the reconfiguration graphs arising from the list coloring and the DP-coloring of graphs at the Discrete Math Seminar
On May 23, 2022, Stijn Cambie from the IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on the problem of determining the diameter of the reconfiguration graphs arising from the list coloring and the DP-coloring of graphs. The title of his talk was “The precise diameter of reconfiguration graphs“.










