Almost spanning distance trees in subsets of finite vector spaces

DOI10.1112/blms.13022MaRDI QIDQ6499409

Ben D. Lund, Debsoumya Chakraborti

Publication date: 8 May 2024

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

finite fieldsErdős distance problemgeometric structures in pseudo-random graphs

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Distance in graphs (05C12) Erd?s problems and related topics of discrete geometry (52C10) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

This page was built for publication: Almost spanning distance trees in subsets of finite vector spaces