seminar Archives - Page 15 of 33 - Discrete Mathematics Group

April 29, 2022July 6, 2024

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“.

April 26, 2022July 6, 2024

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“.

April 13, 2022July 6, 2024

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“.

April 12, 2022July 6, 2024

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“.

March 30, 2022July 6, 2024

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“.

March 28, 2022July 6, 2024

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“.

March 22, 2022July 6, 2024

Jaehoon Kim (김재훈) gave a talk on the Ramsey number with respect to a cycle and an arbitrary graph at the Discrete Math Seminar

On March 21, 2022, Jaehoon Kim (김재훈) from KAIST gave a talk at the Discrete Math Seminar on the Ramsey number with respect to a cycle graph and an arbitrary graph. The title of his talk was “Ramsey numbers of cycles versus general graphs“.

March 15, 2022July 6, 2024

Tuan Anh Do gave a talk on rank-width and tree-width of supercritical random graphs at the Discrete Math Seminar

On March 14, 2022, Tuan Anh Do (Tuấn Anh Đỗ) from the Graz University of Technology / IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on rank-width and tree-width of graphs of supercritical random graphs at the Discrete Math Seminar. The title of his talk was “Rank- and tree-width of supercritical random graphs“.

March 10, 2022July 6, 2024

Fedor Fomin gave an online talk on fixed-parameter algorithms to decide whether a 2-connected graph has a cycle whose length is at least k plus the bound given by the Dirac’s theorem or the Erdős-Gallai theorem at the Virtual Discrete Math Colloquium

On March 10, 2022, Fedor Fomin from the University of Bergen gave an online talk at the Virtual Discrete Math Colloquium on the parameterized complexity of determining whether a 2-connected graph has a cycle of length at least k plus the bound given by the Dirac’s theorem or the Erdős-Gallai theorem. The title of his talk was “Long cycles in graphs: Extremal Combinatorics meets Parameterized Algorithms“.

March 7, 2022July 6, 2024

Kevin Hendrey gave a talk on a unified Erdős-Pósa theorem for cycles in graphs labeled by multiple abelian groups at the Discrete Math Seminar

On March 7, 2022, Kevin Hendrey from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on a unified Erdős-Pósa theorem for cycles in graphs labeled by multiple abelian groups at the Discrete Math Seminar. The title of his talk was “A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups (revisited)“.

Category: seminar