We stand with Ukraine  

László Miklós Lovász

Orcid: 0000-0002-0696-1115

Affiliations:
  • Massachusetts Institute of Technology, Department of Mathematics, Cambridge, MA, USA (PhD 2017)
  • University of California Los Angeles, Department of Mathematics, CA, USA
  • University of Cambridge, Trinity College, UK


According to our database1, László Miklós Lovász authored at least 12 papers between 2013 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Cycles of a given length in tournaments.
[BibTeX]
[DOI]
Andrzej Grzesik
,
Daniel Král'
,
László Miklós Lovász
,
Jan Volec
J. Comb. Theory B, 2023

2019
A fast new algorithm for weak graph regularity.
[BibTeX]
[DOI]
Jacob Fox
,
László Miklós Lovász
,
Yufei Zhao
Comb. Probab. Comput., 2019

2018
A polynomial bound for the arithmetic <i>k</i>-cycle removal lemma in vector spaces.
[BibTeX]
[DOI]
Jacob Fox
,
László Miklós Lovász
,
Lisa Sauermann
J. Comb. Theory A, 2018

Erratum: On Regularity Lemmas and their Algorithmic Applications.
[BibTeX]
[DOI]
Jacob Fox
,
László Miklós Lovász
,
Yufei Zhao
Comb. Probab. Comput., 2018

Elusive extremal graphs.
[BibTeX]
[DOI]
Andrzej Grzesik
,
Daniel Král'
,
László Miklós Lovász
CoRR, 2018

2017
On derivatives of graphon parameters.
[BibTeX]
[DOI]
László Miklós Lovász
,
Yufei Zhao
J. Comb. Theory A, 2017

Extremal graph theory and finite forcibility.
[BibTeX]
[DOI]
Andrzej Grzesik
,
Daniel Král'
,
László Miklós Lovász
Electron. Notes Discret. Math., 2017

On Regularity Lemmas and their Algorithmic Applications.
[BibTeX]
[DOI]
Jacob Fox
,
László Miklós Lovász
,
Yufei Zhao
Comb. Probab. Comput., 2017

A tight lower bound for Szemerédi's regularity lemma.
[BibTeX]
[DOI]
Jacob Fox
,
László Miklós Lovász
Comb., 2017

A tight bound for Green's arithmetic triangle removal lemma in vector spaces.
[BibTeX]
[DOI]
Jacob Fox
,
László Miklós Lovász
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
A short proof of the equivalence of left and right convergence for sparse graphs.
[BibTeX]
[DOI]
László Miklós Lovász
Eur. J. Comb., 2016

2013
Nowhere-zero 3-flows and modulo k-orientations.
[BibTeX]
[DOI]
László Miklós Lovász
,
Carsten Thomassen
,
Yezhou Wu
,
Cun-Quan Zhang
J. Comb. Theory B, 2013


  Loading...