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“.
Andreas Holmsen gave a talk on a colorful generalization of the Goodman-Pollack-Wenger transversal theorem
On May 16, 2022, Andreas Holmsen from KAIST presented a theorem proving a colorful generalization of the Goodman-Pollack-Wenger theorem, answering a conjecture of Arocha, Bracho, and Montejano, at the Discrete Math Seminar. The title of his talk was “A colorful version of the Goodman-Pollack-Wenger transversal theorem“.
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“.
Boram Park (박보람) gave a talk on the odd coloring of graphs at the Discrete Math Seminar
On April 25, 2022, Boram Park (박보람) from Ajou University gave a talk at the Discrete Math Seminar on the odd coloring of graphs, which is a proper coloring of a graph such that every non-isolated vertex has a color having an odd number of neighbors having that color. The title of her talk was “Odd coloring of sparse graphs“.
Jakub Gajarský gave an online talk on the FO model checking on Interpretations of Classes of Bounded Local Clique-width at the Virtual Discrete Math Colloquium
On April 13, 2022, Jakub Gajarský from the University of Warsaw gave an online talk at the Virtual Discrete Math Colloquium on the FO model checking on interpretations of classes of graphs of bounded local clique-width. The title of his talk was “Model Checking on Interpretations of Classes of Bounded Local Clique-Width“.
Younjin Kim (김연진) gave a talk on the number of k-dimensional corner-free subsets in the k-dimensional grid at the Discrete Math Seminar
On April 11, 2022, Younjin Kim (김연진) from POSTECH gave a talk at the Discrete Math Seminar on the number of k-dimensional corner-free subsets of the k-dimensional grid {1,2,…n}^k. The title of her talk was “On the extremal problems related to Szemerédi’s theorem“.
Jean-Florent Raymond gave an online talk on the maximum length of an induced path in a graph having a long path at the Virtual Discrete Math Colloquium
On March 30, 2022, Jean-Florent Raymond from LIMOS, CNRS, France gave an online talk at the Virtual Discrete Math Colloquium on the maximum length of an induced path in a graph having a long path when the graph has bounded path-width, tree-width, or excludes a fixed topological minor. The title of his talk was “Long induced paths in minor-closed graph classes and beyond“.
Ben Lund gave a talk on the threshold function for a random subset of a finite vector space to have certain intersection properties with all m-dimensional affine subspaces at the Discrete Math Seminar
On March 28, 2022, Ben Lund from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on the threshold function for a random subset of a finite vector space to have certain intersection properties with all m-dimensional affine subspaces at the Discrete Math Seminar. The title of his talk was “Thresholds for incidence properties in finite vector spaces“.











