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/}
}
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/