Joonkyung Lee

activity

20102026

most citedSome advances on Sidorenko's conjecture

37 citations · 102 across the 20 of their papers we have counts for

collaborators

Showing 2019Show all

5 papers · 1 filter

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★ 4 cited

Two remarks on graph norms

Frederik Garbe, Jan Hladký, Joonkyung Lee

For a graph $H$ , its homomorphism density in graphs naturally extends to the space of two-variable symmetric functions $W$ in $L^{p}$ , $p \geq e (H)$ , denoted by $t (H, W)$ . One may then…

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…