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