On November 11, 2021, Sebastian Wiederrecht from LIRMM gave an online talk at the Virtual Discrete Math Colloquium on building the graph structure theory for matching minors. The title of his talk was “Matching Minors in Bipartite Graphs“.
Jaehoon Kim (김재훈) gave a talk on a sufficient condition for a 2-complex to have a unique embedding in a 3-dimensional space, which is a 3-dimensional analog of Whitney’s theorem on the uniqueness of planar embeddings of a 3-connected graph at the Discrete Math Seminar
On November 9, 2021, Jaehoon Kim (김재훈) from KAIST gave a talk at the Discrete Math Seminar on a 3-dimensional analog of Whitney’s theorem on the uniqueness of planar embeddings of a 3-connected graph. The title of his talk was “2-complexes with unique embeddings in 3-space“.
Martin Milanič gave an online talk on a variation of tree-width of graphs by measuring the width of a tree-decomposition by the size of the largest stable set in a bag at the Virtual Discrete Math Colloquium
On November 5, 2021, Martin Milanič from the University of Primorska, Slovenia gave an online talk at the Virtual Discrete Math Colloquium on a variation of tree-width by measuring the width of a tree-decomposition by the size of the largest stable set in a bag and its algorithmic applications to the maximum weight stable set. The title of his talk was “Tree Decompositions with Bounded Independence Number“.
Ben Lund gave a talk on the smallest size of maximal 3-wise intersecting families of sets at the Discrete Math Seminar
On November 2, 2021, Ben Lund from IBS Discrete Mathematics Group gave a talk on the smallest possible size of a maximal 3-wise intersecting family of subsets of {1,2,…,n} for large n, answering a problem of Erdős and Kleitman proposed in 1974. The title of his talk was “Maximal 3-wise intersecting families“.
Donggyu Kim (김동규) gave a talk on 𝝘-graphic delta-matroids and their algorithmic applications at the Discrete Math Seminar
On October 26, 2021, Donggyu Kim (김동규) from KAIST & IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar, introducing 𝝘-graphic delta-matroids and showing their algorithmic applications. The title of his talk was “𝝘-graphic delta-matroids and their applications“.
Joonkyung Lee (이준경) gave a talk about the majority dynamics on sparse random graphs at the Discrete Math Seminar
On October 12, 2021, Joonkyung Lee (이준경) from the Hanyang University gave a talk about the majority dynamics on sparse random graphs. The title of his talk was “Majority dynamics on sparse random graphs“.
Paul Seymour gave an online talk on the polynomial 𝜒-boundedness of graph classes at the Virtual Discrete Math Colloquium
On October 8, 2021, Paul Seymour from Princeton University gave an online talk at the Virtual Discrete Math Colloquium on the polynomial 𝜒-boundedness of graph classes. The title of his talk was “Polynomial bounds for chromatic number“.
Eunjin Oh (오은진) gave a talk on a parameterized complexity of the feedback vertex set problem on unit disk graphs at the Discrete Math Seminar
On October 5, 2021, Eunjin Oh (오은진) from POSTECH gave a talk at the Discrete Math Seminar on the parameterized complexity of the feedback vertex set problem on unit disk graphs at the Discrete Math Seminar. The title of her talk was “Feedback Vertex Set on Geometric Intersection Graphs“.
Péter Pál Pach gave an online talk on the solution of the Alon-Jaeger-Tarsi conjecture at the Virtual Discrete Math Colloquium
On September 30, 2021, Péter Pál Pach from the Budapest University of Technology and Economics gave an online talk at the Virtual Discrete Math Colloquium on the solution of the Alon-Jaeger-Tarsi conjecture for all finite fields of size more than 61 but not equal to 79. The title of his talk was “The Alon-Jaeger-Tarsi conjecture via group ring identities“.
Kevin Hendrey gave a talk on the edge density of graphs having no H-minor for a sparse graph H at the Discrete Math Seminar
On September 28, 2021, Kevin Hendrey from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on the supremum of the edge density of graphs not having H-minors, when H is in a graph class admitting strongly sublinear separators. The title of his talk was “Extremal functions for sparse minors“.