기초과학연구원 이산수학그룹
On August 30, 2022, Jun Gao (高峻) from the IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar about the tight upper bound on the number of (k-1)-cliques in a k-critical graph, solving the conjecture of Abbott and Zhou in 1992. The title of his talk was “Number of (k-1)-cliques in k-critical graph“.
On August 23, 2022, Raul Lopes from LAMSADE, CNRS of Paris, France gave a talk at the Discrete Math Seminar about analogs of Menger’s theorem on temporal graphs. The title of his talk was “Temporal Menger and related problems“.
On August 16, 2022, Noleen Köhler from the CNRS, LAMSADE gave a talk at the Discrete Math Seminar on comparing testable properties on graphs of bounded maximum degree and properties expressible by the first-order logic. The title of her talk was “Testing first-order definable properties on bounded degree graphs“. She is currently visiting the IBS Discrete Mathematics Group from August 6 to August 26.
On August 9, 2022, Eun Jung Kim (김은정) from CNRS, LAMSADE, Paris gave a talk at the Discrete Math Seminar on a randomized algorithm for a flow-augmentation in digraphs and its applications for parameterized complexity. The title of her talk was “Directed flow-augmentation“.
On August 3, 2022, Lars Jaffke from the University of Bergen gave an online talk at the Virtual Discrete Math Colloquium on characterizing hereditary graph classes with polynomially many minimal separators. The title of his talk was “Taming graphs with no large creatures and skinny ladders“.
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“.
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“.
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“.
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“.
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“.