activity
20172024
most citedComplexes of graphs with bounded independence number

8 citations · 28 across the 19 of their papers we have counts for

collaborators

20 papers

math.CO2024

Colorful fractional Helly theorem via weak saturation

Debsoumya Chakraborti, Minho Cho, Jinha Kim +1

Two celebrated extensions of the classical Helly's theorem are the fractional Helly theorem and the colorful Helly theorem. Bulavka, Goodarzi, and Tancer recently established the o…

math.AC2023

An Eisenbud-Goto type inequality for Stanley-Reisner ideals and simplicial complexes

Jaewoo Jung, Jinha Kim, Minki Kim +1

The Leray number of an abstract simplicial complex is the minimal integer where its induced subcomplexes have trivial homology groups in dimension or greater. We give an up…

math.CO2023

Independent domination versus packing in subcubic graphs

Eun-Kyung Cho, Minki Kim

In 2011, Henning, Löwenstein, and Rautenbach observed that the domination number of a graph is bounded from above by the product of the packing number and the maximum degree of the…

math.CO2023

Extensions of the Colorful Helly Theorem for -collapsible and -Leray complexes

Minki Kim, Alan Lew

We present extensions of the Colorful Helly Theorem for -collapsible and -Leray complexes, providing a common generalization to the matroidal versions of the theorem due to K…

math.CO2023

Strong Erdős-Hajnal properties in chordal graphs

Minho Cho, Andreas F. Holmsen, Jinha Kim +1

A graph class has the strong Erdős-Hajnal property (SEH-property) if there is a constant such that for every member of , eithe…

math.CO2022★ 3 cited

Independent domination of graphs with bounded maximum degree

Eun-Kyung Cho, Jinha Kim, Minki Kim +1

An independent dominating set of a graph, also known as a maximal independent set, is a set of pairwise non-adjacent vertices such that every vertex not in is adjacent to s…