依赖随机选择与偶轮的广义Turán数

Dependent Random Choice and Generalized Turán Numbers of Even Wheels

摘要: 令G表示n个顶点的图，K₃表示图G中的三角形。W_2L^s 表示中心有s个顶点，外围是一个2l长的偶圈，且偶圈上的2l条边都与中心的s个点相连的一个图；P_L^s 表示中心有s个顶点，外围是一条l长的路，且路上的l条边都与中心的s个点相连的一个图。在本文中，我们主要利用依赖随机选择技术证明了下述广义Turán数：

Abstract: 1)。 2)。 Let G be a graph on n vertices, and K₃ be a triangle in graph G. We denoted by W_2L^s a graph with s vertices in the center, a 2l long even circle in the periphery, and 2l edges on the even circle are connected with s vertices in the center; and P_L^s represents a graph in which the center has s ver-tices, the periphery is an l-long road, and ledges of the road are connected with s vertices of the center. In this paper, we mainly proved that the following generalized Turán number by using the technique of dependent random choice: 1) . 2).