On September 5, 2023, Sebastian Wiederrecht from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on the Erdős-Pósa property of H-minors in a graph from a minor-closed class of graphs for Kuratowski-connected shallow-vortex minors H. The title of his talk was “Delineating half-integrality of the Erdős-Pósa property for minors“.
Dabeen Lee (이다빈) gave a talk on characterizing ideal multipartite clutters constructed from subspaces of finite vector spaces in terms of forbidden clutter minors at the Discrete Math Seminar
On August 29, 2023, Dabeen Lee (이다빈) from KAIST gave a talk at the Discrete Math Seminar on characterizing ideal multipartite clutters constructed from subspaces of finite vector spaces in terms of forbidden clutter minors. The title of his talk was “From coordinate subspaces over finite fields to ideal multipartite uniform clutters.”
Linda Cook gave a talk on bounding the dichromatic number after forbidding a fixed orientation of a path at the Discrete Math Seminar
On August 22, 2023, Linda Cook from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on bounding the dichromatic number of a directed graph not having an induced subgraph isomorphic to a fixed orientation of a path. The title of her talk was “Orientations of P_4 bind the dichromatic number“.
R. Amzi Jeffs gave a talk on the intersection patterns of convex sets at the Discrete Math Seminar
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“.
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.”
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.”











