On February 15, 2022, Jinha Kim (김진하) from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on the minimum size of a maximal independent set (or equivalently, an independent dominating set) in a graph of maximum degree at most $\Delta$. The title of her talk was “Independent domination of graphs with bounded maximum degree“.
On November 19, 2021, Jinha Kim (김진하) of the IBS Discrete Mathematics Group received the Excellence Award for Young Scientist (미래인재상) by Korea Federation of Women’s Science and Technology Associations (KOFWST, 한국여성과학기술단체총연합회). This award was created to recognize woman scientists and engineers who have the potentials to elevate the nation’s competitiveness in science through great passion, dedication, and remarkable achievement in their work. Congratulations!
On December 22, 2020, at the Discrete Math Seminar, Jinha Kim (김진하) from the IBS Discrete Mathematics Group presented the proof of the Kalai-Meshulam conjecture by Zhang and Wu, proving that for a graph G, the total Betti number of the independence complex of every induced subgraph of G is at most 1 if and only if G has no induced cycle of length 0 mod 3. The title of her talk was “On a conjecture by Kalai and Meshulam – the Betti number of the independence complex of ternary graphs“.
On September 22, 2020, Jinha Kim (김진하) from the IBS Discrete Mathematics Group presented her recent work on the collapsibility of the non-cover complexes of graphs at the Discrete Math Seminar. The non-cover complex of a graph is a simplicial complex consisting of subsets of vertices not covering all edges. The title of her talk was “Collapsibility of Non-Cover Complexes of Graphs“.
Jinha Kim (김진하) received his Ph.D. from the Department of Mathematics at Seoul National University in 2019 under the supervision of Prof. Woong Kook. Until recently, she was a postdoctoral fellow at Technion in Israel. She is interested in combinatorics, discrete geometry, topological combinatorics, and graph theory.