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.
J. Comb. Theory B, 2023

2019
A fast new algorithm for weak graph regularity.
Comb. Probab. Comput., 2019

2018
A polynomial bound for the arithmetic <i>k</i>-cycle removal lemma in vector spaces.
J. Comb. Theory A, 2018

Erratum: On Regularity Lemmas and their Algorithmic Applications.
Comb. Probab. Comput., 2018

Elusive extremal graphs.
CoRR, 2018

2017
On derivatives of graphon parameters.
J. Comb. Theory A, 2017

Extremal graph theory and finite forcibility.
Electron. Notes Discret. Math., 2017

On Regularity Lemmas and their Algorithmic Applications.
Comb. Probab. Comput., 2017

A tight lower bound for Szemerédi's regularity lemma.
Comb., 2017

A tight bound for Green's arithmetic triangle removal lemma in vector spaces.
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.
Eur. J. Comb., 2016

2013
Nowhere-zero 3-flows and modulo k-orientations.
J. Comb. Theory B, 2013


  Loading...