Jaehoon Kim

activity

20222025

most citedOn rainbow Turán Densities of Trees

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

collaborators

Showing 2024Show all

3 papers · 1 filter

math.CO2024

Transversal cycles and paths in tournaments

Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee +1

Thomason [ $Trans. Amer. Math. Soc.$ 296.1 (1986)] proved that every sufficiently large tournament contains Hamilton paths and cycles with all possible orientations, except…

math.CO2024

On the $(k + 2, k)$ -problem of Brown, Erdős and Sós for $k = 5, 6, 7$

Stefan Glock, Jaehoon Kim, Lyuben Lichev +2

Let $f^{(r)} (n; s, k)$ denote the maximum number of edges in an $n$ -vertex $r$ -uniform hypergraph containing no subgraph with $k$ edges and at most $s$ vertices. Brown, Erdős and Sós…

math.CO2024

Dense triangle-free $(n, d, λ)$ -graphs for all orders

Jaehoon Kim, Hyunwoo Lee

In 1994, Alon construct a triangle-free $(n, d, λ)$ -graph with $d = Ω (n^{2/3})$ and $λ = O (d^{1/2})$ for an exponentially increasing sequence of integers $n$ . Using his ingenious cons…

Transversal cycles and paths in tournaments

On the (k+2,k)-problem of Brown, Erdős and Sós for k=5,6,7

Dense triangle-free (n,d,λ)-graphs for all orders

On the $(k + 2, k)$ -problem of Brown, Erdős and Sós for $k = 5, 6, 7$

Dense triangle-free $(n, d, λ)$ -graphs for all orders