On the Minimal Number of Edges in Induced Subgraphs of Special Distance Graphs
Matematičeskie zametki, Tome 111 (2022) no. 6, pp. 929-939

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

Three new theorems are proved in the paper, which give bounds for the number of edges in induced subgraphs of a special distance graph.
Keywords: distance graphs, Johnson graphs.
@article{MZM_2022_111_6_a11,
     author = {Ya. K. Shubin},
     title = {On the {Minimal} {Number} of {Edges} in {Induced} {Subgraphs} of {Special} {Distance} {Graphs}},
     journal = {Matemati\v{c}eskie zametki},
     pages = {929--939},
     publisher = {mathdoc},
     volume = {111},
     number = {6},
     year = {2022},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2022_111_6_a11/}
}
TY  - JOUR
AU  - Ya. K. Shubin
TI  - On the Minimal Number of Edges in Induced Subgraphs of Special Distance Graphs
JO  - Matematičeskie zametki
PY  - 2022
SP  - 929
EP  - 939
VL  - 111
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2022_111_6_a11/
LA  - ru
ID  - MZM_2022_111_6_a11
ER  - 
%0 Journal Article
%A Ya. K. Shubin
%T On the Minimal Number of Edges in Induced Subgraphs of Special Distance Graphs
%J Matematičeskie zametki
%D 2022
%P 929-939
%V 111
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2022_111_6_a11/
%G ru
%F MZM_2022_111_6_a11
Ya. K. Shubin. On the Minimal Number of Edges in Induced Subgraphs of Special Distance Graphs. Matematičeskie zametki, Tome 111 (2022) no. 6, pp. 929-939. http://geodesic.mathdoc.fr/item/MZM_2022_111_6_a11/