2015, Jacob W. Cooper, Tomáš Kaiser, Daniel Kráľ, Jonathan A. Noel, “Weak regularity and finitely forcible graph limits”, in(Please provide the book title or journal name)[1]:
This bound almost matches the known upper bound for graphs and, in a certain sense, is the best possible forgraphons.
