default search action
László Miklós Lovász
Person information
- affiliation (PhD 2017): Massachusetts Institute of Technology, Department of Mathematics, Cambridge, MA, USA
- affiliation: University of California Los Angeles, Department of Mathematics, CA, USA
- affiliation: University of Cambridge, Trinity College, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j10]Andrzej Grzesik, Daniel Král', László Miklós Lovász, Jan Volec
:
Cycles of a given length in tournaments. J. Comb. Theory B 158(Part): 117-145 (2023)
2010 – 2019
- 2019
- [j9]Jacob Fox, László Miklós Lovász, Yufei Zhao:
A fast new algorithm for weak graph regularity. Comb. Probab. Comput. 28(5): 777-790 (2019) - 2018
- [j8]Jacob Fox, László Miklós Lovász, Yufei Zhao:
Erratum: On Regularity Lemmas and their Algorithmic Applications. Comb. Probab. Comput. 27(5): 851-852 (2018) - [j7]Jacob Fox, László Miklós Lovász
A polynomial bound for the arithmetic k-cycle removal lemma in vector spaces. J. Comb. Theory A 160: 186-201 (2018) - [i3]Jacob Fox, László Miklós Lovász, Yufei Zhao:
A fast new algorithm for weak graph regularity. CoRR abs/1801.05037 (2018) - [i2]Andrzej Grzesik, Daniel Král', László Miklós Lovász:
Elusive extremal graphs. CoRR abs/1807.01141 (2018) - 2017
- [j6]Jacob Fox, László Miklós Lovász:
A tight lower bound for Szemerédi's regularity lemma. Comb. 37(5): 911-951 (2017) - [j5]Jacob Fox, László Miklós Lovász, Yufei Zhao:
On Regularity Lemmas and their Algorithmic Applications. Comb. Probab. Comput. 26(4): 481-505 (2017) - [j4]Andrzej Grzesik
Extremal graph theory and finite forcibility. Electron. Notes Discret. Math. 61: 541-547 (2017) - [j3]László Miklós Lovász
On derivatives of graphon parameters. J. Comb. Theory A 145: 364-368 (2017) - [c1]Jacob Fox, László Miklós Lovász:
A tight bound for Green's arithmetic triangle removal lemma in vector spaces. SODA 2017: 1612-1617 - 2016
- [j2]László Miklós Lovász
A short proof of the equivalence of left and right convergence for sparse graphs. Eur. J. Comb. 53: 1-7 (2016) - 2014
- [i1]Jacob Fox, László Miklós Lovász:
A tight lower bound for Szemerédi's regularity lemma. CoRR abs/1403.1768 (2014) - 2013
- [j1]László Miklós Lovász, Carsten Thomassen
Nowhere-zero 3-flows and modulo k-orientations. J. Comb. Theory B 103(5): 587-598 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: