37 citations · 102 across the 20 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018★ 25 cited
Sidorenko's conjecture for blow-ups
David Conlon, Joonkyung Lee
A celebrated conjecture of Sidorenko and Erdős-Simonovits states that, for all bipartite graphs , quasirandom graphs contain asymptotically the minimum number of copies of t…
math.CO2018
On the extremal number of subdivisions
David Conlon, Joonkyung Lee
One of the cornerstones of extremal graph theory is a result of Füredi, later reproved and given due prominence by Alon, Krivelevich and Sudakov, saying that if is a bipartite…
math.CO2018★ 4 cited
Sidorenko's conjecture for higher tree decompositions
David Conlon, Jeong Han Kim, Choongbum Lee +1
This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for str…