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

## 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)

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

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

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