Ph. A. Pushnyakov, A. M. Raigorodskii, “Estimate of the number of edges in subgraphs of a Johnson graph”, Dokl. RAN. Math. Inf. Proc. Upr., 2021, Volume 499,Pages <nobr>40–43</nobr>

RUS ENG

JOURNALS // Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia // Archive

Dokl. RAN. Math. Inf. Proc. Upr., 2021 Volume 499, Pages 40–43 (Mi danma187)

This article is cited in 7 papers

MATHEMATICS

Estimate of the number of edges in subgraphs of a Johnson graph

Ph. A. Pushnyakov^a, A. M. Raigorodskii^abcd

^a Moscow Institute of Physics and Technology (National Research University), Dolgoprudnyi, Moscow oblast, Russia
^b Lomonosov Moscow State University, Moscow, Russia
^c Caucasus Mathematical Center, Adyghe State University, Maykop, Republic of Adygea, Russia
^d Buryat State University, Institute for Mathematics and Informatics, Ulan-Ude, Buryat Republic, Russia

Abstract: New estimates for the minimum number of edges in subgraphs of a Johnson graph are obtained.

Keywords: Johnson graph, distance graphs, Turán's theorem.

UDC: 519.1

Presented: V. V. Kozlov
Received: 01.11.2019
Revised: 09.05.2021
Accepted: 16.05.2021

DOI: 10.31857/S2686954321040135

English version: Doklady Mathematics, 2021, 104:1, 193–195

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025