Geodesic
Estimate of the number of edges in subgraphs of a Johnson graph
Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ, Tome 499 (2021), pp. 40-43

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

New estimates for the minimum number of edges in subgraphs of a Johnson graph are obtained.
Keywords: Johnson graph, distance graphs, Turán's theorem. 
@article{DANMA_2021_499_a8,
     author = {Ph. A. Pushnyakov and A. M. Raigorodskii},
     title = {Estimate of the number of edges in subgraphs of a {Johnson} graph},
     journal = {Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleni\^a},
     pages = {40--43},
     publisher = {mathdoc},
     volume = {499},
     year = {2021},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DANMA_2021_499_a8/}
}
TY  - JOUR
AU  - Ph. A. Pushnyakov
AU  - A. M. Raigorodskii
TI  - Estimate of the number of edges in subgraphs of a Johnson graph
JO  - Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ
PY  - 2021
SP  - 40
EP  - 43
VL  - 499
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DANMA_2021_499_a8/
LA  - ru
ID  - DANMA_2021_499_a8
ER  - 
%0 Journal Article
%A Ph. A. Pushnyakov
%A A. M. Raigorodskii
%T Estimate of the number of edges in subgraphs of a Johnson graph
%J Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ
%D 2021
%P 40-43
%V 499
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DANMA_2021_499_a8/
%G ru
%F DANMA_2021_499_a8
Ph. A. Pushnyakov; A. M. Raigorodskii. Estimate of the number of edges in subgraphs of a Johnson graph. Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ, Tome 499 (2021), pp. 40-43. http://geodesic.mathdoc.fr/item/DANMA_2021_499_a8/