Hostname: page-component-5cf477f64f-rdph2 Total loading time: 0 Render date: 2025-04-04T08:38:23.171Z Has data issue: false hasContentIssue false
  • English
  • Français

Erratum: On Regularity Lemmas and their Algorithmic Applications

Published online by Cambridge University Press:  22 March 2018

JACOB FOX ,
LÁSZLÓ MIKLÓS LOVÁSZ  and
YUFEI ZHAO
JACOB FOX
Affiliation:
Department of Mathematics, Stanford University, Stanford, CA 94305, USA (e-mail: jacobfox@stanford.edu)
LÁSZLÓ MIKLÓS LOVÁSZ
Affiliation:
Department of Mathematics, UCLA, Los Angeles, CA 90095, USA (e-mail: lmlovasz@math.ucla.edu)
YUFEI ZHAO
Affiliation:
Department of Mathematics, MIT, Cambridge, MA 02139, USA (e-mail: yufeiz@mit.edu)
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Erratum
Information
Combinatorics, Probability and Computing , Volume 27 , Issue 5 , September 2018 , pp. 851 - 852
Copyright
Copyright © Cambridge University Press 2018 

References

[1] Dellamonica, D., Kalyanasundaram, S., Martin, D., Rödl, V. and Shapira, A. (2012) A deterministic algorithm for the Frieze–Kannan regularity lemma. SIAM J. Discrete Math. 26 15–29.Google Scholar
[2] Dellamonica, D. Jr, Kalyanasundaram, S., Martin, D. M., Rödl, V. and Shapira, A. (2015) An optimal algorithm for finding Frieze–Kannan regular partitions Combin. Probab. Comput. 24 407–437.Google Scholar
[3] Fox, J., Lovász, L. M. and Zhao, Y. (2017) On regularity lemmas and their algorithmic applications. Combin. Probab. Comput. https://doi.org/10.1017/S0963548317000049Google Scholar
[4] Fox, J., Lovász, L. M. and Zhao, Y. A fast new algorithm for weak graph regularity. arXiv:1801.05037Google Scholar