기초과학연구원 이산수학그룹
On June 2, 2020, Huy-Tung Nguyen from KAIST gave a talk on the graph parameter called the average cut-rank of a graph. The title of his talk is “The average cut-rank of graphs“.
On May 26, 2020, Hong Liu from University of Warwick presented a talk on his recent work describing approximate structures of an n-vertex m-edge graph minimizing the number of cliques of size k. The title of his talk was “Asymptotic Structure for the Clique Density Theorem”.
On May 19, 2020, O-joung Kwon (권오정) from Incheon National University and IBS Discrete Mathematics Group presented a survey talk on the MIM-width of graphs. The title of his talk was “Mim-width: a width parameter beyond rank-width“.
Note added on June 2020
After I presented the talk, Benjamin Bergougnoux commented me that the claim of (Boyaci, Ekim, Shalom 17) at 1:02:40 was recently disproved by Kratochvíl, Masařík, and Novotná (https://arxiv.org/abs/2002.08311). I would like to thank Benjamin for the comment. Whether or not there is a polynomial-time algorithm for Max Cut on proper interval graphs is still open.
On May 12, 2020, Eun Jung Kim (김은정) from LAMSADE, CNRS presented a talk on her recent work on the twin-width. The title of her talk was “Twin-width: tractable FO model checking“. She is visiting the IBS discrete mathematics group from May 12 for about 4 months.
Due to COVID-19, it was decided to postpone the following two workshops to be held in August, 2020 at IBS by the organizers of each workshop.
On April 28, 2020, Seunghun Lee (이승훈) from KAIST presented a talk on the topological property of the non-matching complex, that is a simplicial complex consisting of subgraphs on the same vertex set having no matching of size k and its application to the rainbow matching problem of graphs. The title of his talk is “Leray numbers of complexes of graphs with bounded matching number“.
On April 21, 2020, Sang-il Oum gave a survey talk on vertex-minors of graphs at the discrete math seminar. The title of his talk was “survey on vertex-minors“.
On April 14, 2020, Casey Tompkins from IBS discrete mathematics group gave a talk on the saturation version of the problems related to the Erdős-Szekeres theorem on convex k-gons, sequences, and posets. The title of his talk is “Saturation problems in the Ramsey theory of graphs, posets and point sets“.
On April 7, 2020, Pascal Gollin presented his work on the relation between the packing of edge sets intersecting all directed cuts in some class B and the maximum size of a minimal nonempty directed cut in B, motivated by Woodall’s conjecture. The title of his talk is “Disjoint dijoins for classes of dibonds in finite and infinite digraphs“.
IBS is inviting applications for Young Scientist Fellowship. The application due is May 31, 2020. To be eligible, one should be within 7 years of obtaining a Ph.D. or under the age of 40 with a Ph.D. (born no earlier than 1 January 1980).
This is a full-time research position and the appointment is for 3 years with a possible 2-year extension depending on the performance review results. (If a current IBS researcher is appointed as YSF, then the maximum duration is 3 years.)
Please check https://www.ibs.re.kr/ysf/ and https://dimag.ibs.re.kr/ysf/ for more information.
IBS DIMAG will also have a few openings. The successful candidate will join the discrete mathematics group with his or her own separate research budget.