This article is cited in 16 papers

Estimate of the Number of Edges in Special Subgraphs of a Distance Graph

Ph. A. Pushnyakov^a, A. M. Raigorodskii<sup>abcd

a</sup> Moscow Institute of Physics and Technology (State University), Dolgoprudny, Moscow region
^b Lomonosov Moscow State University
^c Caucasus Mathematical Center, Adyghe State University, Maikop
^d Buryat State University, Institute for Mathematics and Informatics, Ulan-Ude

Abstract: The classical problem of estimating the number of edges in a subgraph of a special distance graph is considered. Old results are significantly improved.

Keywords: extremal combinatorics, Turán theorem.

UDC: 517

PACS: 02.10.Ox

Received: 12.06.2018
Revised: 01.09.2019

DOI: 10.4213/mzm12088

 English version: Mathematical Notes, 2020, 107:2, 322–332

Bibliographic databases:

• 
• 
•