Jaehoon Kim

activity

20122024

most citedBipartitions of highly connected tournaments

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

collaborators

Showing math.COShow all

8 papers · 1 filter

math.CO2024

Optimal bounds on the polynomial Schur's theorem

Jaehoon Kim, Hong Liu, Péter Pál Pach

Liu, Pach and Sándor recently characterized all polynomials $p (z)$ such that the equation $x + y = p (z)$ is $2$ -Ramsey, that is, any $2$ -coloring of $N$ contains infinitely ma…

math.CO2023

Covering multigraphs with bipartite graphs

Jaehoon Kim, Hyunwoo Lee

Hansel's lemma states that $\sum_{H \in H} ∣ H ∣ \geq n lo g_{2} n$ holds where $H$ is a collection of bipartite graphs covering all the edges of $K_{n}$ . We generalize…

math.CO2023

A bandwidth theorem for graph transversals

Debsoumya Chakraborti, Seonghyuk Im, Jaehoon Kim +1

Given a collection $G = (G_{1}, \dots, G_{h})$ of graphs on the same vertex set $V$ of size $n$ , an $h$ -edge graph $H$ on the vertex set $V$ is a $G$ -transversal if th…

math.CO2022

A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems

Seonghyuk Im, Jaehoon Kim, Joonkyung Lee +1

Hypertrees are linear hypergraphs where every two vertices are connected by a unique path. Elliott and Rödl conjectured that for any given $μ > 0$ , there exists $n_{0}$ such that the f…

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…