7 citations · 18 across the 18 of their papers we have counts for
4 papers · 1 filter
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…
Packing and finding paths in sparse random graphs
Vesna Iršič, Julien Portier, Leo Versteegen
Let be a (hidden) Erdős-Rényi random graph with for some fixed constant . Ferber, Krivelevich, Sudakov, and Vieira showed tha…
A proof of a conjecture of Erdős and Gyárfás on monochromatic path covers
Alexey Pokrovskiy, Leo Versteegen, Ella Williams
In 1995, Erdős and Gyárfás proved that in every -edge-coloured complete graph on vertices, there exists a collection of monochromatic paths, all of the same colo…
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…