Edge maximal C2k+1-edge disjoint free graphs

Abstract

For two positive integers r and s, G(n; r, s) denotes to the class of graphs on n vertices containing no r of s-edge disjoint cycles and f(n;r,s) = max{ε(G): G ∈ G(n;r,s)}. In this paper, for integers r ≥ 2 and k ≥ 1, we determine f(n; r,2k + 1) and characterize the edge maximal members in G(n;r,2k + 1).