Turán number of complete multipartite graphs in multipartite graphs

2024/05/26 by Han, Jie, Zhao, Yi
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2405.16561

Abstract

In this paper we study a multi-partite version of the Erdős--Stone theorem. Given integers r

Related

• Turan's theorem inverted
• Turán Number of Subdivisions of Multipartite Graphs
• Complete subgraphs in multipartite graphs
• Turan numbers of bipartite subdivisions
• Turán numbers of vertex-disjoint cliques in r-partite graphs