News

March 28, 2022July 6, 2024

The MATRIX-IBS Workshop “Structural Graph Theory Downunder II” was held from March 20 to March 27

The MATRIX-IBS Workshop “Structural Graph Theory Downunder II” was held from March 20 to March 27 at Creswick, Victoria, Australia. This program is supported by MATRIX and the Discrete Mathematics Group (DIMAG) of the Institute for Basic Science (IBS, Korea). MATRIX is a residential research institute for the mathematical sciences in Australia.

Participants

Rutger Campbell (IBS Discrete Mathematics Group, Korea)
Katie Clinch (University of Melbourne, Australia)
Marc Distel (Monash University, Australia)
Jackson Goerner (Monash University, Australia)
Pascal Gollin (IBS Discrete Mathematics Group, Korea)
Daniel Harvey (Ballarat, Australia)
Kevin Hendrey (IBS Discrete Mathematics Group, Korea)
Robert Hickingbotham (Monash University, Australia)
Tony Huynh (Monash University, Australia)
Thomas Lesgourges (UNSW Sydney, Australia)
Freddie Illingworth (University of Oxford, UK)
Bojan Mohar (Simon Fraser University, Canada)
Michael Payne (La Trobe University, Australia)
Youri Tamitegama (University of Oxford, UK)
Jane Tan (University of Oxford, UK)
David Wood (Monash University, Australia)

Organizers

David Wood (Monash University, Australia)
Tony Huynh (Monash University, Australia)
Sang-il Oum (KAIST and Institute for Basic Science, Korea)
Alex Scott (University of Oxford, UK)
Liana Yepremyan (Emory University, USA)

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 11, 2022July 6, 2024

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.

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

February 28, 2022July 6, 2024

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

February 28, 2022July 6, 2024

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.

February 26, 2022July 6, 2024

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

February 18, 2022July 6, 2024

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