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

## Jan Kurkofka gave an online talk on the canonical decomposition of finite graphs into highly connected local parts at the Virtual Discrete Math Colloquium

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

## 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

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

## Cheolwon Heo (허철원) gave a talk on the dichotomy of the problem on deciding the existence of a binary matroid homomorphism to a fixed binary matroid at the Discrete Math Seminar

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

## Michael Savery gave an online talk 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

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

기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209