기초과학연구원 이산수학그룹
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“.
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
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“.
On May 16, 2019, Xin Zhang (张欣) from Xidian University, China discusses various results on the equitable tree-k-coloring of graphs, a problem of partitioning the vertex set of a graph into vertex-disjoint induced subgraphs having no cycles with almost same size. The title of his talk was “On equitable tree-colorings of graphs“. Xin Zhang is visiting IBS Discrete Mathematics Group from May 15 to May 19.
Sang June Lee (이상준) from Duksung Women’s University presented his recent work on the strong Sidon sets at the Discrete Math Seminar on May 8, 2019. The title of his talk was “On strong Sidon sets of integers“.
Rose McCarty from University of Waterloo presented her recent breakthrough on the polynomially 𝜒-boundedness of circle graphs at the Discrete Math Seminar on April 26, 2019 . The title of her talk was “circle graphs are polynomially chi-bounded.”
Sang-il Oum delivered the plenary lecture at the 2019 Korean Mathematical Society Spring Meeting (대한수학회 봄 연구발표회) held at the Kangwon National University in Chuncheon on April 19-20, 2019. The title of his talk was “How to decompose a graph into a tree-like structure”.
Jon-Lark Kim (김종락) from Sogang University presented a talk at Discrete Math Seminar on April 18, 2019. The title of his talk was “Introduction to Boolean functions with Artificial Neural Network“.
Andreas Holmsen from KAIST gave a talk at Discrete Math Seminar on March 12, 2019 under the title “large cliques in hypergraphs with forbidden substructures.” His work extended a result of extremal graph theory due to Gyárfás, Hubenko, and Solymosi, answering a question of Erdős to hypergraphs and has interesting consequences in topological combinatorics and abstract convexity.
DIMAG had its first workshop “2019-1 IBS Workshop on Graph Theory” on February 11 and 12, 2019. There were 6 invited talks — Jeong Han Kim (KIAS), Cory T. Palmer (Univ. of Montana), Martin Balko (Charles Univ.), Dong Yeap Kang (KAIST), Boram Park (Ajou Univ.), and Dániel Gerbner (Alfréd Rényi Institute of Mathematics). We would like to thank all speakers and participants.
The talks are recorded but due to technical problems, only four talks are available online.