4 papers
On the extremal number of incidence graphs
Jisun Baek, David Conlon, Joonkyung Lee
Given a graph and a natural number , the extremal number is the largest number of edges in an -vertex graph containing no copy of . In this paper,…
On norming systems of linear equations
Seokjoon Cho, David Conlon, Joonkyung Lee +2
A system of linear equations is said to be norming if a natural functional giving a weighted count for the set of solutions to the system can be used to define a n…
Around the positive graph conjecture
David Conlon, Joonkyung Lee, Leo Versteegen
A graph is said to be positive if the homomorphism density is non-negative for all weighted graphs . The positive graph conjecture proposes a characterisation of su…
A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
Seonghyuk Im, Jaehoon Kim, Joonkyung Lee +1
Hypertrees are linear hypergraphs where every two vertices are connected by a unique path. Elliott and Rödl conjectured that for any given , there exists such that the f…