arXiv:2106.02438 Abstract | arXiv Analytics

arXiv:2106.02438 [math.CO]Abstract References Reviews Resources

New Turan-type bounds for Johnson graphs

Published 2021-06-04Version 1

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.

Categories: math.CO

Keywords: johnson graphs, turan-type bounds, johnsons graphs, extremal properties, arbitrary subgraph

Related articles: Most relevant | Search more

arXiv:0712.1622 [math.CO] (Published 2007-12-11)

Primitive decompositions of Johnson graphs

Alice Devillers, Michael Giudici, Cai Heng Li, Cheryl E. Praeger

arXiv:2003.10956 [math.CO] (Published 2020-03-24)

Equitable 2-partitions of Johnson graphs with the second eigenvalue

Konstantin Vorob'ev

arXiv:2204.03308 [math.CO] (Published 2022-04-07)

On extremal properties of perfect 2-colorings

Vladimir N. Potapov