91 citations · 263 across the 31 of their papers we have counts for
28 papers · 1 filter
Flows on measurable spaces
Laszlo Lovasz
The theory of graph limits is only understood to any nontrivial degree in the cases of dense graphs and of bounded degree graphs. There is, however, a lot of interest in the interm…
Cycles of a given length in tournaments
Andrzej Grzesik, Daniel Kral, Laszlo Miklos Lovasz +1
We study the asymptotic behavior of the maximum number of directed cycles of a given length in a tournament: let be the limit of the ratio of the maximum number of cycles…
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…
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 $…
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…
A polynomial bound for the arithmetic -cycle removal lemma in vector spaces
Jacob Fox, László Miklós Lovász, Lisa Sauermann
For each , Green proved an arithmetic -cycle removal lemma for any abelian group . The best known bounds relating the parameters in the lemma for general are of…