2021/06/04 by Nikita Dubinin Andreevich, Andreevich, Nikita Dubinin
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2106.02438
openalex publication_date 2021/06/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.