This article is cited in 4 papers

On the Minimal Number of Edges in Induced Subgraphs of Special Distance Graphs

Ya. K. Shubin

Lomonosov Moscow State University

Abstract: 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.

UDC: 519

Received: 23.11.2021
Revised: 29.01.2022

DOI: 10.4213/mzm13370

 English version: Mathematical Notes, 2022, 111:6, 961–969

Bibliographic databases:

•