On October 22, 2019, Joonkyung Lee (이준경) from University of Hamburg gave a talk based on his recent work on weakly norming and norming graphs. The title of his talk was “On some properties of graph norms“.
Zi-Xia Song (宋梓霞) gave a talk on Ramsey numbers under Gallai colorings at the discrete math seminar
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.”
Alexandr V. Kostochka gave a talk on a problem related to the graph reconstruction conjecture at the discrete math seminar
On October 10, 2019, Prof. Alexandr V. Kostochka from the University of Illinois at Urbana-Champaign gave a talk at the discrete math seminar. The title of his talk was “Reconstructing graphs from smaller subgraphs“.
Alexandr V. Kostochka gave a colloquium talk on Ramsey-type problems for paths and cycles at the KAIST MathSci – IBS DIMAG Joint Colloquium
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.
Casey Tompkins gave a talk on the extremal problems for Berge hypergraphs at the discrete math seminar
On October 1, 2019, Casey Tompkins at IBS discrete mathematics group presented a seminar talk on an extension of Turán’s theorem to hypergraphs. The title of his talk was “Extremal problems for Berge hypergraphs“.
Cory Palmer gave a survey talk on the Turán-type subgraph counting problems at the discrete math seminar
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.
Kevin Hendrey presented his work on the minimum connectivity to force a minor isomorphic to a fixed forest in a large graph at the discrete math seminar
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“.
Mihyun Kang (강미현) presented her work on the genus of random graphs and randomly perturbed graphs at the Discrete Math Seminar
On August 20, 2019, Mihyun Kang (강미현) from Graz University of Technology, Austria presented her work on the genus of random graphs and randomly perturbed graphs at the Discrete Math Seminar. The title of her talk was “The genus of a random graph and the fragile genus property“. She will stay until August 22, 2019 at the IBS Discrete Mathematics Group.
Dabeen Lee (이다빈) presented his work on algorithmic problems of finding a clutter minor at the Discrete Math Seminar
On July 16, 2019, Dabeen Lee (이다빈) from IBS Discrete Mathematics Group presented his work on identifying a clutter minor related to ideal clutters at the Discrete Math Seminar. The title of his talk was “Integrality of set covering polyhedra and clutter minors“.
Patrice Ossona de Mendez presented his work on the structural sparsity of graphs in terms of a model theoretic notion at the discrete math seminar
On June 25, 2019, Patrice Ossona de Mendez from CNRS, France presented a talk on the structural sparsity of graphs in terms of the model theoretic notion of first-order transduction. The title of his talk was “A model theoretical approach to sparsity“.