New Turan-type bounds for Johnson graphs
Combinatorics
2021-06-07 v1
Abstract
In this paper, we consider the Johnson's graphs. We study the extremal properties of the Johnson's graphs. Namely, we investigate the number of edges in an arbitrary subgraph of this graph. Namely, in this article we prove analogs of Turan's 1941 theorem.
Keywords
Cite
@article{arxiv.2106.02438,
title = {New Turan-type bounds for Johnson graphs},
author = {Nikita Dubinin Andreevich},
journal= {arXiv preprint arXiv:2106.02438},
year = {2021}
}