至多k个2连通块的图的最大边数

The maximum number of edges of a graph with at most k 2-connected blocks

对k=[√1.02n]和k=[√n],分别给出至多k个2连通块的n阶无等长圈图的最大边数g_(2)(n,k)的一个下界g_(2)(n,[√1.02n])≥n+√(2+899/2363)n(1-0(1)),g_(2)(n[√n])≥n+√(2+484/1279)n(1-0(1)),其中n为充分大的正整数.

Fork=[√1.02n] and k=[√n],this paper gives a lower bound of the maximum possible number of edges g2(n,k)for a graph of order n without isometric cycles with at most k 2-connected blocks:g_(2)(n,[√1.02n])≥n+√(2+899/2363)n(1-0(1)),g_(2)(n[√n])≥n+√(2+484/1279)n(1-0(1)),where n is a sufficiently large positive integer.