On November 19, 2019, Ruth Luo from University of California San Diego gave a talk on the Turán-type results on r-uniform hypergraphs without a certain structure called an induced Berge-F. The title of her talk was “Induced Turán problems for hypergraphs“. She is visiting IBS discrete mathematics group until November 22.
On November 12, Tony Huynh from Monash University gave a talk on the maximum weight stable set problem on graphs with bounded odd cycle packing number. The title of his talk was “Stable sets in graphs with bounded odd cycle packing number“.
On October 29, 2019, Pascal Gollin from IBS discrete mathematics group gave a talk on the existence of a decomposition of an infinite graph into spanning trees in terms of the existence of packing and covering of spanning trees at the discrete math seminar. The title of his talk was “A Cantor-Bernstein-type theorem for spanning trees in infinite graphs“.
On October 15, 2019, Prof Zi-Xia Song (宋梓霞) from University of Central Florida (UCF) presented a talk about Ramsey numbers under Gallai colorings. The title of her talk was “Ramsey numbers of cycles under Gallai colorings.”
On October 8, 2019, Prof. Alexandr V. Kostochka from the University of Illinois at Urbana-Champaign gave a colloquium talk at the KAIST Mathematical Sciences – IBS Discrete Mathematics Group Joint Colloquium. The title of his talk was “On Ramsey-type problems for paths and cycles in dense graphs“. He will stay one week at IBS Discrete Mathematics Group.
On September 19, 2019, Cory Palmer from University of Montana presented a survey talk on the Turán-type subgraph counting problems at the discrete math seminar. The title of his talk was “A survey of Turán-type subgraph counting problems“. He will stay at the IBS discrete mathematics group until October 3, 2019.
On September 10, 2019, Kevin Hendrey at IBS Discrete Mathematics Group presented his work on the minimum connectivity to force a minor isomorphic to a fixed forest in a large graph. The title of his talk was “The minimum connectivity forcing forest minors in large graphs”.