On August 9, 2023, R. Amzi Jeffs from Carnegie Mellon University gave a talk at the Discrete Math Seminar on the simplicial complexes and convex codes arising from the intersections of convex sets. The title of his talk was “Intersection patterns of convex sets“.
The 2023 Mini-Workshop on Discrete Geometry was held on August 9 with three talks by Michael Dobbins, Andreas Holmsen, and Minki Kim
On August 9, 2023, the 2023 Mini-Workshop on Discrete Geometry was held at the IBS. This workshop consisted of three talks by Michael Dobbins from SUNY Binghamton, Andreas Holmsen from KAIST, and Minki Kim from GIST. Here is the list of talks.
- Michael Dobbins (SUNY Binghamton): Colorful intersections, Tverberg partitions, and geometric transversals
- Andreas Holmsen (KAIST): The topology of the complex of ordered partitions
- Minki Kim김민기 (GIST): Some variants of the colorful Helly theorems
Welcome Haotian Yang from Shandong University, a new visiting undergraduate student in the IBS Extremal Combinatorics and Probability Group
The IBS Discrete Mathematics Group welcomes Haotian Yang, a new visiting student of the IBS Extremal Combinatorics and Probability Group. He is currently an undergraduate student of Shandong University. He arrived at IBS on August 6, 2023 and will stay with us until February 1, 2024.
Daniel Kráľ gave a talk on common graphs with large chromatic numbers at the Discrete Math Seminar
On August 2, 2023, Daniel Kráľ from Masaryk University gave a talk on constructing common graphs with large chromatic numbers at the Discrete Math Seminar. The title of his talk was “High chromatic common graphs.”
Dong Yeap Kang (강동엽) gave a talk on the existence of a largest possible matching in a random subhypergraph of a k-uniform hypergraph with the codegree condition at the Discrete Math Seminar
On July 25, 2022, Dong Yeap Kang (강동엽) from the IBS Extremal Combinatorics and Probability Group gave a talk at the Discrete Math Seminar on the existence of a largest possible matching in a random subhypergraph of a k-uniform hypergraph with the codegree condition. The title of his talk was “Hamilton cycles and optimal matchings in a random subgraph of uniform Dirac hypergraphs.”
Wojciech Samotij gave lectures for 5 days in a summer school at IBS
From July 17 to July 21, 2023, Wojciech Samotij from Tel Aviv University gave a lecture series at IBS on the method of hypergraph containers. This summer school was organized by the IBS Extremal Combinatorics and Probability Group and attended by about 40 people offline and more than 100 people online.

Andrzej Grzesik gave a talk on the rainow Turán problems at the Discrete Math Seminar
On July 18, 2023, Andrzej Grzesik from Jagiellonian University gave a talk at the Discrete Math Seminar on the rainbow version of Turán problems. The title of his talk was “rainbow Turán problems.”
Open Symposium at the Discrete Mathematics Group
On July 13, 2023, the Open Symposium at the Discrete Mathematics Group was held. There were four talks by the members of the Discrete Mathematics Group.
9:40-10:05 | Obstructions for dense analogs of tree-depth | Sang-il OUM |
10:05-10:20 | Structural and extremal results for twin-width | Kevin HENDREY |
10:20-10:35 | Down-sets in combinatorial posets | Rutger CAMPBELL |
10:35-10:50 | Reuniting 𝜒-boundedness with polynomial 𝜒-boundedness | Linda COOK |
Xuding Zhu gave a talk on the list version of the 1-2-3 conjecture and the usage of Combinatorial Nullstellensatz at the Discrete Math Seminar
On July 10, 2023, Xuding Zhu from Zhejiang Normal University gave a talk at the Discrete Math Seminar on the 1-2-3 conjecture of Karoński, Łuczak, and Thomason, its list version by Bartnicki, Grytczuk, and Niwczyk, and the usage of Combinatorial Nullstellensatz. The title of his talk was “List version of 1-2-3 conjecture.”
Tuan Tran gave a talk on a Sauer-Shelah-type lemma in the study of the maximal pattern entropy of a theoretical dynamical system at the Discrete Math Seminar
On July 4, 2023, Tuan Tran from the University of Science and Technology of China gave a talk on a Sauer-Shelah-type lemma in the study of the maximal pattern entropy of a theoretical dynamical system and its connection to a recent result in communication complexity at the Discrete Math Seminar. The title of his talk was “Complexity of null dynamical systems.”