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

7 papers

math.CO2025

On a Ramsey--Turán variant of Roth's theorem

Matija Bucić, Micha Christoph, Jaehoon Kim +2

A classical theorem of Roth states that the maximum size of a solution-free set of a homogeneous linear equation $L$ in $F_{p}$ is $o (p)$ if and only if the sum of…

math.CO2025

Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions

Nemanja Draganić, Jaehoon Kim, Hyunwoo Lee +3

Dirac's classical theorem asserts that, for $n \geq 3$ , any $n$ -vertex graph with minimum degree at least $n /2$ is Hamiltonian. Furthermore, if we additionally assume that such grap…

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…

math.CO2023★ 1 cited

On rainbow Turán Densities of Trees

Seonghyuk Im, Jaehoon Kim, Hyunwoo Lee +1

For a given collection $G = (G_{1}, \dots, G_{k})$ of graphs on a common vertex set $V$ , which we call a \emph{graph system}, a graph $H$ on a vertex set $V (H) \subseteq V$ is…

math.CO2022

Conflict-free hypergraph matchings

Stefan Glock, Felix Joos, Jaehoon Kim +2

A celebrated theorem of Pippenger, and Frankl and Rödl states that every almost-regular, uniform hypergraph $H$ with small maximum codegree has an almost-perfect matching…

On a Ramsey--Turán variant of Roth's theorem

Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions

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 rainbow Turán Densities of Trees

Conflict-free hypergraph matchings

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