This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles
I think that the reference at the bottom of the page, saying that the property of being triangle-free may be tested by a tower of height poly(1/ε) needs to be changed. A recent paper of Jacob Fox ("A new proof of the graph removal lemma") contains a proof that one may take a tower of height logarithm in 1/ε. —Preceding unsigned comment added by Busy365 (talk • contribs) 14:49, 8 September 2010 (UTC)[reply]
I believe that the mentioned article indeed has this, but by Wikipedia guidelines this will have to wait until the article is published in a conference or a journal. Eldar (talk) 23:25, 14 September 2010 (UTC)[reply]
Ok, now that it has been accepted to a journal it was put here. — Preceding unsigned comment added by Eldar (talk • contribs) 22:54, 30 January 2011 (UTC)[reply]
