Joonkyung Lee

activity

20182022

most citedRainbow cycles in properly edge-colored graphs

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

collaborators

9 papers

math.CO2022★ 2 cited

Rainbow cycles in properly edge-colored graphs

Jaehoon Kim, Joonkyung Lee, Hong Liu +1

We prove that every properly edge-colored $n$ -vertex graph with average degree at least $100 (lo g n)^{2}$ contains a rainbow cycle, improving upon $(lo g n)^{2 + o (1)}$ bound due to To…

math.CO2022★ 1 cited

Extended commonality of paths and cycles via Schur convexity

Jang Soo Kim, Joonkyung Lee

A graph $H$ is \emph{common} if the number of monochromatic copies of $H$ in a 2-edge-colouring of the complete graph $K_{n}$ is asymptotically minimised by the random colouring, or…

math.CO2019

Convex graphon parameters and graph norms

Joonkyung Lee, Bjarne Schülke

Sidorenko's conjecture states that the number of copies of a bipartite graph $H$ in a graph $G$ is asymptotically minimised when $G$ is a quasirandom graph. A notorious example whe…

math.CO2019

Ramsey games near the critical threshold

David Conlon, Shagnik Das, Joonkyung Lee +1

A well-known result of Rödl and Ruciński states that for any graph $H$ there exists a constant $C$ such that if $p \geq C n^{- 1/ m_{2} (H)}$ , then the random graph $G_{n, p}$ is a.a.s.…

math.CO2019

Odd cycles in subgraphs of sparse pseudorandom graphs

Sören Berger, Joonkyung Lee, Mathias Schacht

We answer two extremal questions about odd cycles that naturally arise in the study of sparse pseudorandom graphs. Let $Γ$ be an $(n, d, λ)$ -graph, i.e., $n$ -vertex, $d$ -regular grap…

math.CO2019

More on the extremal number of subdivisions

David Conlon, Oliver Janzer, Joonkyung Lee

Given a graph $H$ , the extremal number $ex (n, H)$ is the largest number of edges in an $H$ -free graph on $n$ vertices. We make progress on a number of conjectures about the…