91 citations · 263 across the 31 of their papers we have counts for
Showing 2018 · math.COShow all
3 papers · 2 filters
math.CO2018★ 8 cited
Elusive extremal graphs
Andrzej Grzesik, Daniel Král', László Miklós Lovász
We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended fu…
math.CO2018★ 12 cited
A lower bound for the -multicolored sum-free problem in
László Miklós Lovász, Lisa Sauermann
In this paper, we give a lower bound for the maximum size of a -colored sum-free set in , where and are fixed and tends to infinity. If $…
math.CO2018★ 1 cited
A fast new algorithm for weak graph regularity
Jacob Fox, László Miklós Lovász, Yufei Zhao
We provide a deterministic algorithm that finds, in time, an -regular Frieze-Kannan partition of a graph on vertices. The algorithm outputs an approximation…