Jaehoon Kim

activity

20122015

most citedBipartitions of highly connected tournaments

1 citations · 2 across the 5 of their papers we have counts for

collaborators

4 papers

math.CO2014★ 1 cited

Bipartitions of highly connected tournaments

Jaehoon Kim, Daniela Kühn, Deryk Osthus

We show that if $T$ is a strongly $1 0^{9} k^{6} lo g (2 k)$ -connected tournament, there exists a partition $A, B$ of $V (T)$ such that each of $T [A]$ , $T [B]$ and $T [A, B]$ is strongly $k$ -co…

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.CO2012

Harmonious Coloring of Trees with Large Maximum Degree

Saieed Akbari, Jaehoon Kim, Alexandr Kostochka

A harmonious coloring of $G$ is a proper vertex coloring of $G$ such that every pair of colors appears on at most one pair of adjacent vertices. The harmonious chromatic number of…

Bipartitions of highly connected tournaments

On the number of r-matchings in a Tree

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

Harmonious Coloring of Trees with Large Maximum Degree

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