Younjin Kim

activity

20112023

most citedDynamic coloring of graphs having no

K_{5}

minor

15 citations · 24 across the 16 of their papers we have counts for

collaborators

Showing 2014Show all

3 papers · 1 filter

math.CO2014

On the number of $r$ -matchings in a Tree

Dong Yeap Kang, Jaehoon Kim, Younjin Kim +1

An $r$ -matching in a graph $G$ is a collection of edges in $G$ such that the distance between any two edges is at least $r$ . A $2$ -matching is also called an induced matching. In t…

math.CO2014

On the Erdos-Ko-Rado Theorem and the Bollobas Theorem for t-intersecting families

Dong Yeap Kang, Jaehoon Kim, Younjin Kim

A family $F$ is $t$ - $intersecting$ if any two members have at least $t$ common elements. Erd\H os, Ko, and Rado proved that the maximum size of a $t$ -intersecting fa…

math.CO2014

Identifying codes and searching with balls in graphs

Younjin Kim, Mohit Kumbhat, Zoltan Lorant Nagy +3

Given a graph $G$ and a positive integer $R$ we address the following combinatorial search theoretic problem: What is the minimum number of queries of the form "does an unknown ver…

On the number of r-matchings in a Tree

On the Erdos-Ko-Rado Theorem and the Bollobas Theorem for t-intersecting families

Identifying codes and searching with balls in graphs

On the number of $r$ -matchings in a Tree