On October 10, 2023, Domagoj Bradač from ETH Zürich gave a talk at the Discrete Math Seminar on upper bounds for the induced size-Ramsey number of cycles. The title of his talk was “Effective bounds for induced size-Ramsey numbers of cycles“.
Carl R. Yerger gave a talk on the graph pebbling at the Discrete Math Seminar
On September 26, 2023, Carl R. Yerger from Davidson College gave a talk at the Discrete Math Seminar on graph pebbling. The title of his talk was “Solving Problems in Graph Pebbling Using Optimization and Structural Techniques“. He will stay at the IBS Discrete Mathematics Group until October 12.
Donggyu Kim (김동규) gave a talk on defining orthogonal matroids (or even delta-matroids) over tracts at the Discrete Math Seminar
On September 19, 2023, Donggyu Kim (김동규) from KAIST and the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on defining orthogonal matroids (or, equivalently even delta-matroids) over tracts and its applications to several theorems regarding representability. The title of his talk was “Orthogonal matroids over tracts.”
Seog-Jin Kim (김석진) gave a talk on the list chromatic number of the square of subcubic planar graphs of girth at least 6 at the Discrete Math Seminar
On September 12, 2023, Seog-Jin Kim (김석진) from Konkuk University gave a talk at the Discrete Math Seminar on the list chromatic number of the square of subcubic planar graphs of girth at least 6. The title of his talk was “The square of every subcubic planar graph of girth at least 6 is 7-choosable“.
Sebastian Wiederrecht gave a talk 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 at the Discrete Math Seminar
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.”











