On the Number of Edges in Induced Subgraphs of a Special Distance Graph
Matematičeskie zametki, Tome 99 (2016) no. 4, pp. 550-558

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

We obtain new estimates for the number of edges in induced subgraphs of a special distance graph.
Keywords: distance graph, cycle, coloring, Borsuk problem.
Mots-clés : clique
@article{MZM_2016_99_4_a6,
     author = {Ph. Pushnyakov},
     title = {On the {Number} of {Edges} in {Induced} {Subgraphs} of a {Special} {Distance} {Graph}},
     journal = {Matemati\v{c}eskie zametki},
     pages = {550--558},
     publisher = {mathdoc},
     volume = {99},
     number = {4},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2016_99_4_a6/}
}
TY  - JOUR
AU  - Ph. Pushnyakov
TI  - On the Number of Edges in Induced Subgraphs of a Special Distance Graph
JO  - Matematičeskie zametki
PY  - 2016
SP  - 550
EP  - 558
VL  - 99
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2016_99_4_a6/
LA  - ru
ID  - MZM_2016_99_4_a6
ER  - 
%0 Journal Article
%A Ph. Pushnyakov
%T On the Number of Edges in Induced Subgraphs of a Special Distance Graph
%J Matematičeskie zametki
%D 2016
%P 550-558
%V 99
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2016_99_4_a6/
%G ru
%F MZM_2016_99_4_a6
Ph. Pushnyakov. On the Number of Edges in Induced Subgraphs of a Special Distance Graph. Matematičeskie zametki, Tome 99 (2016) no. 4, pp. 550-558. http://geodesic.mathdoc.fr/item/MZM_2016_99_4_a6/