Joonkyung Lee works on extremal combinatorics. With David Conlon and Alexander Sidorenko, he studied connections between the Sidorenko conjecture and extremal numbers.[ref]
Extremal numbers and Sidorenko’s conjecture by David Conlon and others. Original byline and abstract
The graph conjecture concerns lower bounds on homomorphism densities for bipartite graphs. The paper investigates hypergraph analogues, where counterexamples exist, and uses those failures to improve lower bounds for the number of edges in a forbidden-configuration-free hypergraph.[ref]
Extremal numbers and Sidorenko’s conjecture by David Conlon and others. Introduction, equation 1 and abstract
New to topics? Read the docs here!