Almost spanning distance trees in subsets of finite vector spaces

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

Cites Work

Tree embeddings
Expanding graphs contain all small trees
On the Erdős distinct distances problem in the plane
Averages over hyperplanes, sum-product theory in vector spaces over finite fields and the Erdős-Falconer distance conjecture
Erdös distance problem in vector spaces over finite fields
Pinned distance sets, \(k\)-simplices, Wolff's exponent in finite fields and sum-product estimates
On Sets of Distances of n Points
Explicit construction of linear sized tolerant networks
On the Hausdorff dimensions of distance sets
Title not available (Why is that?)
On distinct perpendicular bisectors and pinned distances in finite fields
The Erdős distance problem
Distance sets of two subsets of vector spaces over finite fields
Sharp \(L^2\) estimates of the Schrödinger maximal function in higher dimensions
Elementary methods for incidence problems in finite fields
Incidences between points and generalized spheres over finite fields and related problems
Finite analogues of Euclidean space
On Falconer's distance set problem in the plane
Simplices over finite fields
Breaking the 3/2 Barrier for Unit Distances in Three Dimensions
Bisectors and pinned distances
A point-sphere incidence bound in odd dimensions and applications
Expanders – how to find them, and what to find in them
On the pinned distances problem in positive characteristic
Cycles of arbitrary length in distance graphs on \(\mathbb{F}_q^d\)
On the Finite Field Cone Restriction Conjecture in Four Dimensions and Applications in Incidence Geometry
Weak hypergraph regularity and applications to geometric Ramsey theory
Embedding distance graphs in finite field vector spaces
Long paths in the distance graph over large subsets of vector spaces over finite fields
Embeddings of weighted graphs in Erdős-type settings
Rolling backwards can move you forward: On embedding problems in sparse expanders

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499409)