Большие пути в дистанционных графах в векторных пространствах над конечным полем

DOI10.22405/2226-8383-2018-19-3-311-317zbMath1434.11231OpenAlexW2989598862MaRDI QIDQ5109700

Yuriĭ N. Shteĭnikov

Publication date: 13 May 2020

Published in: Чебышевский сборник (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/cheb697

zbMATH Keywords

finite fieldsdistancedistance graphgraph paths

Mathematics Subject Classification ID

Other character sums and Gauss sums (11T24) Distance in graphs (05C12) Erd?s problems and related topics of discrete geometry (52C10)

Related Items (1)

Cycles of arbitrary length in distance graphs on \(\mathbb{F}_q^d\)

Cites Work

• Pinned distance sets, \(k\)-simplices, Wolff's exponent in finite fields and sum-product estimates
• 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
• The analog of the Erdös distance problem in finite fields

This page was built for publication: Большие пути в дистанционных графах в векторных пространствах над конечным полем