Skip to main content
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 20
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Conlon, David Fox, Jacob and Zhao, Yufei 2015. A relative Szemerédi theorem. Geometric and Functional Analysis, Vol. 25, Issue. 3, p. 733.

    Rué, Juanjo Serra, Oriol and Vena, Lluis 2015. Counting configuration–free sets in groups. Electronic Notes in Discrete Mathematics, Vol. 49, p. 549.

    SOLYMOSI, JÓZSEF 2015. The (7, 4)-Conjecture in Finite Groups. Combinatorics, Probability and Computing, Vol. 24, Issue. 04, p. 680.

    Solymosi, József 2013. Roth-type theorems in finite groups. European Journal of Combinatorics, Vol. 34, Issue. 8, p. 1454.

    Elek, Gábor and Szegedy, Balázs 2012. A measure-theoretic approach to the theory of dense hypergraphs. Advances in Mathematics, Vol. 231, Issue. 3-4, p. 1731.

    Cooper, Joshua Fenner, Stephen and Purewal, Semmy 2011. Monochromatic Boxes in Colored Grids. SIAM Journal on Discrete Mathematics, Vol. 25, Issue. 3, p. 1054.

    Li, Jian Lin 2011. Distance sets relating to orthogonal exponentials. Acta Mathematica Sinica, English Series, Vol. 27, Issue. 12, p. 2409.

    Král', Daniel Serra, Oriol and Vena, Lluís 2009. A combinatorial proof of the Removal Lemma for Groups. Journal of Combinatorial Theory, Series A, Vol. 116, Issue. 4, p. 971.

    Rödl, Vojtěch and Schacht, Mathias 2009. Generalizations of the removal lemma. Combinatorica, Vol. 29, Issue. 4, p. 467.

    Haxell, P. E. Nagle, B. and Rödl, V. 2008. An Algorithmic Version of the Hypergraph Regularity Method. SIAM Journal on Computing, Vol. 37, Issue. 6, p. 1728.

    Iosevich, A. and Jaming, P. 2008. Distance sets that are a shift of the integers and Fourier basis for planar convex sets. Acta Mathematica Hungarica, Vol. 121, Issue. 1-2, p. 107.

    Nagle, Brendan Rödl, Vojtěch and Schacht, Mathias 2008. Note on the 3-graph counting lemma. Discrete Mathematics, Vol. 308, Issue. 19, p. 4501.

    Nagle, Brendan Rödl, Vojtěch and Schacht, Mathias 2006. The counting lemma for regulark-uniform hypergraphs. Random Structures and Algorithms, Vol. 28, Issue. 2, p. 113.

    Rödl, V. Tengan, E. Schacht, M. and Tokushige, N. 2006. Density theorems and extremal hypergraph problems. Israel Journal of Mathematics, Vol. 152, Issue. 1, p. 371.

    Rödl, Vojtěch and Skokan, Jozef 2006. Applications of the regularity lemma for uniform hypergraphs. Random Structures and Algorithms, Vol. 28, Issue. 2, p. 180.

    Solymosi, József 2006. Dense Arrangements are Locally Very Dense. I. SIAM Journal on Discrete Mathematics, Vol. 20, Issue. 3, p. 623.

    Tao, Terence 2006. The Gaussian primes contain arbitrarily shaped constellations. Journal d'Analyse Mathématique, Vol. 99, Issue. 1, p. 109.

    Tao, Terence 2006. A variant of the hypergraph removal lemma. Journal of Combinatorial Theory, Series A, Vol. 113, Issue. 7, p. 1257.

    Haxell, P.E. Nagle, B. and Rodl, V. 2005. 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05). p. 439.

    Rodl, V. Nagle, B. Skokan, J. Schacht, M. and Kohayakawa, Y. 2005. From The Cover: The hypergraph regularity method and its applications. Proceedings of the National Academy of Sciences, Vol. 102, Issue. 23, p. 8109.

  • Combinatorics, Probability and Computing, Volume 13, Issue 2
  • March 2004, pp. 263-267

A Note on a Question of Erdős and Graham

  • J. SOLYMOSI (a1) (a2)
  • DOI:
  • Published online: 03 March 2004

We give a quantitative proof that, for sufficiently large $N$, every subset of $[N]^2$ of size at least $\delta N^2$ contains a square, i.e., four points with coordinates $\{(a,b),(a+d,b),(a,b+d),(a+d,b+d)\}$.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *