Jaehoon Kim

activity

20112023

most citedOn a rainbow version of Dirac's theorem

47 citations · 231 across the 46 of their papers we have counts for

collaborators

Showing 2014Show all

4 papers · 1 filter

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.CO2014★ 34 cited

A relative of Hadwiger's conjecture

Katherine Edwards, Dong Yeap Kang, Jaehoon Kim +2

Hadwiger's conjecture asserts that if a simple graph $G$ has no $K_{t + 1}$ minor, then its vertex set $V (G)$ can be partitioned into $t$ stable sets. This is still open, but we prov…

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

A relative of Hadwiger's conjecture

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