Local properties in colored graphs, distinct distances, and difference sets (Q2322550)

The authors establish bounds for the Ramsey problem where the congurations are complete graphs with colored edges and every small induced subgraph contains many distinct colors. Bounds are also established for a set of points in the plane such that every small subset spans many distinct distances, as well as for given sets of real numbers such that every small subset has a large difference set.