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“.
Welcome Tuan Anh Do, a visiting graduate student in the IBS discrete mathematics group from the Graz University of Technology
The IBS Discrete Mathematics Group welcomes Tuan Anh Do (Tuấn Anh Đỗ), a visiting graduate student from the Graz University of Technology in Austria. He is a graduate student of Prof. Mihyun Kang and is planning to stay with us until the end of August 2022.
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“.
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)“.
Sang-il Oum (엄상일) gave a talk at the Discrete Math Seminar on an explicit upper bound of the size of each obstruction for graphs of linear rank-width at most k and matroids of path-width at most k
On February 28, 2022, Sang-il Oum from IBS Discrete Mathematics Group and KAIST gave a talk at the Discrete Math Seminar on an explicit upper bound of the size of pivot-minor obstructions of graphs of linear rank-width at most k and the size of F-representable minor obstructions of matroids of path-width at most k. The title of his talk was “Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k“.
Welcome Prof. Hongseok Yang (양홍석) from KAIST, a new Visiting Research Fellow in the IBS Discrete Mathematics Group
The IBS Discrete Mathematics Group welcomes Prof. Hongseok Yang (양홍석) from the School of Computing, KAIST, Daejeon, Korea. He will visit the IBS Discrete Mathematics Group for 1 year from February 28, 2022 to February 24, 2023 during his sabbatical leave from KAIST. He received his Ph.D. from the University of Illinois at Urbana-Champaign in 2001 and was a University Lecturer, an Assistant Professor, and a Full Professor in the Department of Computer Science at the University of Oxford since May 2011. He moved to KAIST as a full professor in July 2017.
Donggyu Kim (김동규) gave a talk on an analog of the theorem of Oxley and Wu on matroids for vertex-minors of graphs at the Discrete Math Seminar
On February 21, 2022, Donggyu Kim (김동규) from KAIST / IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on an analog of the theorem of Oxley and Wu on matroids for vertex-minors of graphs. The title of his talk was “A stronger version of Tutte’s wheel theorem for vertex-minors“.
Manuel Lafond gave an online talk on a polynomial-time algorithm to recognize k-leaf powers at the Virtual Discrete Math Colloquium
On February 18, 2022, Manuel Lafond from Université de Sherbrooke, Canada gave an online talk at the Virtual Discrete Math Colloquium on a polynomial-time algorithm to recognize k-leaf powers. The title of his talk was “Recognizing k-leaf powers in polynomial time, for constant k“.
Jinha Kim (김진하) gave a talk on the minimum size of a maximal independent set in a graph of bounded maximum degree at the Discrete Math Seminar
On February 15, 2022, Jinha Kim (김진하) from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on the minimum size of a maximal independent set (or equivalently, an independent dominating set) in a graph of maximum degree at most $\Delta$. The title of her talk was “Independent domination of graphs with bounded maximum degree“.
James Davies gave an online talk disproving Esperet’s conjecture on the polynomial 𝜒-boundedness of graph classes at the Virtual Discrete Math Colloquium
On February 10, 2022, James Davies from University of Waterloo gave an online talk at the Virtual Discrete Math Colloquium disproving Esperet’s conjecture on the polynomial 𝜒-boundedness of graph classes. The title of his talk was “Separating polynomial 𝜒-boundedness from 𝜒-boundedness“.