기초과학연구원 이산수학그룹
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“.
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“.
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“.
On May 18, 2022, Jan Kurkofka from the University of Birmingham gave an online talk at the Virtual Discrete Math Colloquium on the canonical decomposition of finite graphs into highly connected local parts. The title of his talk was “Canonical Graph Decompositions via Coverings“.
On May 16, 2022, Andreas Holmsen from KAIST presented a theorem proving a colorful generalization of the Goodman-Pollack-Wenger theorem, answering a conjecture of Arocha, Bracho, and Montejano, at the Discrete Math Seminar. The title of his talk was “A colorful version of the Goodman-Pollack-Wenger transversal theorem“.
On May 9, 2022, Kyeongsik Nam (남경식) from KAIST gave a talk at the Discrete Math Seminar Kyeongsik Nam (남경식) gave a talk on the number of subgraphs isomorphic to a fixed graph in a random graph and the exponential random graph model at the Discrete Math Seminar. The title of his talk was “Large deviations for subgraph counts in random graphs“.
On May 2, 2022, Cheolwon Heo (허철원) from Sungkyunkwan University gave a talk at the Discrete Math Seminar on the dichotomy of the problem on deciding the existence of a binary matroid homomorphism to a fixed binary matroid. The title of his talk was “The complexity of the matroid-homomorphism problems“.
On April 27, 2022, Michael Savery from the Oxford University gave an online talk at the Virtual Discrete Math Colloquium on finding a graph of huge chromatic number such that every induced subgraph of large chromatic number has an induced copy of a fixed subgraph at the Virtual Discrete Math Colloquium. The title of his talk was “Induced subgraphs of induced subgraphs of large chromatic number“.
On April 25, 2022, Boram Park (박보람) from Ajou University gave a talk at the Discrete Math Seminar on the odd coloring of graphs, which is a proper coloring of a graph such that every non-isolated vertex has a color having an odd number of neighbors having that color. The title of her talk was “Odd coloring of sparse graphs“.
On April 13, 2022, Jakub Gajarský from the University of Warsaw gave an online talk at the Virtual Discrete Math Colloquium on the FO model checking on interpretations of classes of graphs of bounded local clique-width. The title of his talk was “Model Checking on Interpretations of Classes of Bounded Local Clique-Width“.