Estimate of the Number of Edges in Special Subgraphs of a Distance Graph
Matematičeskie zametki, Tome 107 (2020) no. 2, pp. 286-298

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
@article{MZM_2020_107_2_a10,
     author = {Ph. A. Pushnyakov and A. M. Raigorodskii},
     title = {Estimate of the {Number} of {Edges} in {Special} {Subgraphs} of a {Distance} {Graph}},
     journal = {Matemati\v{c}eskie zametki},
     pages = {286--298},
     publisher = {mathdoc},
     volume = {107},
     number = {2},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2020_107_2_a10/}
}
TY  - JOUR
AU  - Ph. A. Pushnyakov
AU  - A. M. Raigorodskii
TI  - Estimate of the Number of Edges in Special Subgraphs of a Distance Graph
JO  - Matematičeskie zametki
PY  - 2020
SP  - 286
EP  - 298
VL  - 107
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2020_107_2_a10/
LA  - ru
ID  - MZM_2020_107_2_a10
ER  - 
%0 Journal Article
%A Ph. A. Pushnyakov
%A A. M. Raigorodskii
%T Estimate of the Number of Edges in Special Subgraphs of a Distance Graph
%J Matematičeskie zametki
%D 2020
%P 286-298
%V 107
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2020_107_2_a10/
%G ru
%F MZM_2020_107_2_a10
Ph. A. Pushnyakov; A. M. Raigorodskii. Estimate of the Number of Edges in Special Subgraphs of a Distance Graph. Matematičeskie zametki, Tome 107 (2020) no. 2, pp. 286-298. http://geodesic.mathdoc.fr/item/MZM_2020_107_2_a10/