Short disjoint cycles in graphs with degree constraints

We show that each finite undirected graph G = (V,E),\vertV vertical stroke n, \vertE vertical stroke = m with minimum degree #delta#(G) #>=#,#>=#3 and maximum degree triangle = triangle (G) contains at least n:4(triangle -1)log2n pairwise vertex-disjoint cycles of length at most 4(triangle -1)log2n. Furthermore collections of such cycles can be determined within O(n"2 x m) steps. For constant triangle this means #OMEGA#(n/logn) cycles of length O(logn). This bound is also an optimum. A similar approach yields similar bounds for subgraphs with more edges than vertices instead of cycles. Futhermore also collections of many small pairwise disjoint induced subgraphs of this type can be determined within O(n"2 x m) steps similarly as for cyclesAvailable from TIB Hannover: RO 1945(214) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman