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“.
Suil O (오수일) presented his work on an upper bound of the 3rd largest eigenvalue of a regular graph to guarantee the existence of an odd (1,b)-factor at the discrete math seminar
On June 19, 2019, Suil O (오수일) from SUNY Korea, Incheon presented his work on an upper bound of the third largest eigenvalue of a connected r-regular graph to have an odd (1,b)-factor. The title of his talk was “An odd [1,b]-factor in regular graphs from eigenvalues“.
Jinyoung Park (박진영) presented her work on the number of maximal independent sets in the hypercube graph at the Discrete Math Seminar
On June 3, 2019, Jinyoung Park (박진영) from Rutgers University, USA presented her joint work with Jeff Kahn on the number of maximal independent sets in the hypercube graph at the Discrete Math Seminar. The title of her talk was “The maximal independent sets in the Hamming cube“.
How to subscribe to the seminar schedule on your phone or the Google Calendar
Our website provides the iCal feed of all events, so that one can conveniently subscribe the schedule of seminars on smart phones, desktop calendar applications, and google calendar.
On the iOS (Apple iPhone or iPad) or the Apple MacOS, one can click the following link to subscribe the calendar on the device.
webcal://dimag.ibs.re.kr/events/?ical=1&tribe_display=list
On the Android Phone, we recommend to subscribe the calendar in the Google Calendar. To do so, click “+” after “Other calendars” and click “From URL (URL로 추가)” in the setting and type the following URL.
https://dimag.ibs.re.kr/events/?ical=1&tribe_display=list
Lars Jaffke presented his work on the b-chromatic number of graphs at the Discrete Math Seminar
On May 20, 2019, Lars Jaffke from University of Bergen, Norway presented his work on algorithmic questions regarding the b-chromatic number of graphs at the Discrete Math Seminar. The title of his talk was “A complexity dichotomy for critical values of the b-chromatic number of graphs“.