Embeddings of weighted graphs in Erdős-type settings

DOI10.2140/MOSCOW.2019.8.117zbMath1416.52011arXiv1712.03764OpenAlexW2774180356MaRDI QIDQ2420491

David M. Soukup

Publication date: 6 June 2019

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

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

zbMATH Keywords

graphsdistance setsfinite point configurations

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Cites Work

• The generalized Erdős-Falconer distance problems in vector spaces over finite fields
• On the Erdős distinct distances problem in the plane
• Sum-product estimates via directed expanders
• A sum-product estimate in finite fields, and applications
• LONG PATHS IN THE DISTANCE GRAPH OVER LARGE SUBSETS OF VECTOR SPACES OVER FINITE FIELDS
• Erdös distance problem in vector spaces over finite fields

This page was built for publication: Embeddings of weighted graphs in Erdős-type settings