【摘要】 图G的Turán数ex(m,G)是不包含G作为子图的m阶简单图的最大边数,pP4表示p个不相交的P4的并,其中P4是关于4个顶点的路,笔者给出了ex(m,pP4)的上界和下界.更多还原

【Abstract】 The Turán number ex(m,G) of graph G is the maximum number of edges of a m-vertex simple graph containing no G as a subgraph.pP4 stands for p disjoint copies of P4,in which P4 is the path on four vertices.We give the lower and upper bounds of ex(m,pP4).更多还原