Jaehoon Kim

activity

20122024

F_{1}

-Representations of Pseudotree Quivers

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

collaborators

Showing 2014Show all

3 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…

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

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