Local properties in colored graphs, distinct distances, and difference sets

DOI10.1007/s00493-018-3890-2zbMath1438.05141arXiv1807.00201OpenAlexW2810651120WikidataQ128490066 ScholiaQ128490066MaRDI QIDQ2322550

Adam Sheffer, Cosmin Pohoata

Publication date: 4 September 2019

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.00201

zbMATH Keywords

distinct distancesdifference setsextremal combinatoricscolored graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (10)

On distinct distances between a variety and a point set ⋮ Rainbow subgraphs in edge-colored planar and outerplanar graphs ⋮ Lower bounds on the Erdős–Gyárfás problem via color energy graphs ⋮ The Erdős–Gyárfás function with respect to Gallai‐colorings ⋮ A construction for difference sets with local properties ⋮ Color Isomorphic Even Cycles and a Related Ramsey Problem ⋮ On Cartesian products which determine few distinct distances ⋮ Local Properties via Color Energy Graphs and Forbidden Configurations ⋮ Generalized Ramsey numbers: forbidding paths with few colors ⋮ Progress on local properties problems of difference sets

This page was built for publication: Local properties in colored graphs, distinct distances, and difference sets