Local Properties in Colored Graphs, Distinct Distances, and Difference Sets

Combinatorica volume 39, pages705–714(2019)Cite this article

Abstract

We study Extremal Combinatorics problems where local properties are used to derive global properties. That is, we consider a given configuration where every small piece of the configuration satisfies some restriction, and use this local property to derive global properties of the entire configuration. We study one such Ramsey problem of Erdős and Shelah, where the configurations are complete graphs with colored edges and every small induced subgraph contains many distinct colors. Our bounds for this Ramsey problem show that the known probabilistic construction is tight in various cases. We study one Discrete Geometry variant, also by Erdős, where we have a set of points in the plane such that every small subset spans many distinct distances. Finally, we consider an Additive Combinatorics problem, where we are given sets of real numbers such that every small subset has a large difference set.

We derive new bounds for all of the above problems. Our proof technique is based on introducing a variant of additive energy, which is based on edge colors in graphs.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

US$ 39.95

Tax calculation will be finalised during checkout.

References

  1. [1]

    M. Axenovich, Z. Füredi and D. Mubayi: On generalized Ramsey theory: the bipartite case, J. Combinat. Theory B 79 (2000), 66–86.

    MathSciNet  Article  MATH  Google Scholar 

  2. [2]

    F. A. Behrend: On sets of integers which contain no three terms in arithmetical progression, Proc. Natl. Acad. Sci. U.S.A. 32 (1946), 331.

    MathSciNet  Article  MATH  Google Scholar 

  3. [3]

    D. Conlon, J. Fox, C. Lee and B. Sudakov: The Erdős-Gyárfás problem on generalized Ramsey numbers, Proc. London Math. Soc. 110 (2014), 1–18.

    Article  MATH  Google Scholar 

  4. [4]

    P. Erdős: On some metric and combinatorial geometric problems, Discrete Math. 60 (1986), 147–153.

    MathSciNet  Article  MATH  Google Scholar 

  5. [5]

    P. Erdős: Solved and unsolved problems in combinatorics and combinatorial number theory, Proc. Twelfth Southeastern Conference on Combinatorics, Graph Theory and Compu Congr. Numer. 32 (1981), 49–62.

    MathSciNet  MATH  Google Scholar 

  6. [6]

    P. Erdős: Problems and results on finite and infinite graphs, Recent advances in graph theory (1974), 183–192.

    Google Scholar 

  7. [7]

    P. Erdős: On extremal problems of graphs and generalized graphs, Israel J. Math. 2 (1964), 183–190.

    MathSciNet  Article  MATH  Google Scholar 

  8. [8]

    P. Erdős: On sets of distances of n points, Amer. Math. Monthly 53 (1946), 248–250.

    MathSciNet  Article  MATH  Google Scholar 

  9. [9]

    P. Erdős and A. Gyárfás: A variant of the classical Ramsey problem, Combinatorica 17 (1997), 459–467.

    MathSciNet  Article  MATH  Google Scholar 

  10. [10]

    J. Fox, J. Pach and A. Suk: More distinct distances under local conditions, Combinatorica, to appear.

  11. [11]

    W. T. Gowers: Quasirandom groups, Combin. Probab. Comput. 17 (2008), 363–387.

    MathSciNet  Article  MATH  Google Scholar 

  12. [12]

    L. Guth and N. H. Katz: On the Erdős distinct distances problem in the plane, Annals Math. 181 (2015), 155–190.

    MathSciNet  Article  MATH  Google Scholar 

  13. [13]

    S. Jukna: Extremal combinatorics: with applications in computer science, Springer Science, 2011.

    Google Scholar 

  14. [14]

    G. Sárközy and S. Selkow: On edge colorings with at least q colors in every subset of p vertices, Electron. J. Combin. 8 (2001), R9.

    MathSciNet  MATH  Google Scholar 

  15. [15]

    A. Sheffer: Distinct Distances: Open Problems and Current Bounds, arXiv:1406.1949.

  16. [16]

    T. Tao and V. H. Vu: Additive combinatorics, Cambridge University Press, 2006.

    Google Scholar 

Download references

Author information

Affiliations

  1. California Institute of Technology, Pasadena, CA, USA

    Cosmin Pohoata

  2. Department of Mathematics, Baruch College, City University of New York, New York, NY, USA

    Adam Sheffer

Authors
  1. Cosmin Pohoata
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adam Sheffer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adam Sheffer.

Additional information

Supported by NSF grant DMS-1710305

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Pohoata, C., Sheffer, A. Local Properties in Colored Graphs, Distinct Distances, and Difference Sets. Combinatorica 39, 705–714 (2019). https://doi.org/10.1007/s00493-018-3890-2

Download citation

Mathematics Subject Classification (2010)

  • 05C35
  • 05C55