Joonkyung Lee

I am an Assistant Professor of Mathematics at Yonsei University, Seoul. 

Until February 2023, I was an Assistant Professor at Hanyang University. Before that, I was an IMSS Research Fellow in Pure Mathematics at University College London and a Postdoctoral Researcher at Universität Hamburg working with Mathias Schacht. I was also a Postdoctoral Research Associate at University of Oxford working with David Conlon, who also supervised my PhD at the same university. 

Since April 2023, I am co-organising Discrete Analysis Seminar at Yonsei University.

Some non-Korean speakers might wonder how to pronounce my name properly. The answer is [dʑungjʌŋ] (if this is too hard, then [dʑunkjʌŋ] may be an alternative) in terms of International Phonetic Alphabet, e.g., June + kyoung.

Here are my CV, Google Scholar profile, and papers:

Around the positive graph conjecture, with David Conlon and Leo Versteegen, submitted.

Chi-boundedness of graphs containing no cycles with k chords, with Shoham Letzter and Alexey Pokrovskiy, to appear in Forum. Math. Sigma.

A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems, with Seonghyuk Im, Jaehoon Kim, and Abhishek Methuku, to appear in Forum. Math. Sigma.

Domination inequalities and dominating graphs, with David Conlon, to appear in Math. Proc. Cambridge Philos. Soc.

Odd cycles in subgraphs of sparse pseudorandom graphs, with Sören Berger and Mathias Schacht, to appear in Proc. Amer. Math. Soc.

Rainbow cycles in properly edge-colored graphs, with Jaehoon Kim, Hong Liu, and Tuan Tran, to appear in Combinatorica.

Extremal numbers and Sidorenko's conjecture, with David Conlon and Alexander Sidorenko, Int. Math. Res. Not. 2024, 10285–10297.

Extended commonality of paths and cycles via Schur convexity, with Jang Soo Kim, J. Combin. Theory Ser. B. 166 (2024) 109–122.

Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search, with Abbas Mehrabian, Ankit Anand, Hyunjik Kim, Nicolas Sonnerat, Matej Balog, Gheorghe Comanici, Tudor Berariu, Andrew Lee, Anian Ruoss, Anna Bulanova, Daniel Toyama, Sam Blackwell, Bernardino R. Paredes, Petar Veličković, Laurent Orseau, Anurag M. Naredla, Doina Precup, and Adam Z. Wagner, IJCAI 2024.

Common graphs with arbitrary connectivity and chromatic number, with Sejin Ko, J. Combin. Theory Ser. B. 162 (2023) 222–230.

Majority dynamics on sparse random graphs, with Debsoumya Chakraborti, Jeong Han Kim, and Tuan Tran, Random Structures Algorithms 63 (2023) 171–191.

On graph norms for complex-valued functions, with Alexander Sidorenko,  J. London Math. Soc., 106 (2022) 1501–1538.

On tripartite common graphs, with Andrzej Grzesik, Bernard Lidický, and Jan Volec, Combin. Probab. Comput. 31 (2022), 907–923. 

Two remarks on graph norms, with Frederik Garbe and Jan Hladký, Discrete Comput. Geom., 67 (2022), 919–929.

More on the extremal number of subdivisions, with David Conlon and Oliver Janzer, Combinatorica, 41 (2021), 465–494.

Convex graphon parameters and graph norms, with Bjarne Schülke, Israel J. Math.  242 (2021), 549–563.

On the extremal number of subdivisions, with David Conlon, Int. Math. Res. Not. 2021, 9122–9145.

Sidorenko's conjecture for blow-ups, with David Conlon, Discrete Anal. 2021, Paper No. 2, 13 pp.

On some graph densities in locally dense graphs, Random Structures Algorithms 58 (2021) 322–344.

Ramsey games near the critical threshold, with David Conlon, Shagnik Das, and Tamás Mészáros, Random Structures Algorithms 57 (2020) 940–957.

Some advances on Sidorenko’s conjecture, with David Conlon, Jeong Han Kim, and Choongbum Lee,  J. London Math. Soc.  98 (2018) 593–608. Here is a companion note.

Finite reflection groups and graph norms, with David Conlon, Adv. Math. 315 (2017) 130–165.

Two approaches to Sidorenko’s conjecture, with Jeong Han Kim and Choongbum Lee, Trans. Amer. Math. Soc. 368 (2016) 5057–5074.

Rank-width of random graphs, with Choongbum Lee and Sang-il Oum, J. Graph Theory 70 (2012) 339–347.