Edge-Maximal C_2k+1-vertex disjoint Free Graphs

Let k ≥1 be a positive integer and G( n;V_2k+1) the class of graphs on n vertices containing no 2k+1 vertex disjoint cycles. Let f ( n;V_2k+1)=max{e (G ):G ϵ G( n;V_2k+1). In this paper we determine f ( n;V_2k+1)and characterise the edge maximal members in G( n;V_2k+1) for k=1 and 2.