Contractible edges in triangle-free graphs

An edge of a graph is calledk-contractible if the contraction of the edge results in ak-connected graph. Thomassen [5] proved that everyk-connected graph of girth at least four has ak-contractible edge. In this paper, we study the distribution ofk-contractible edges in triangle-free graphs and show the following: Whenk≧2, everyk-connected graph of girth at least four and ordern≧3k, hasn+(3/2)k2-3k or morek-contractible edges.

[1]  Carsten Thomassen,et al.  Non-separating induced cycles in graphs , 1981, J. Comb. Theory, Ser. B.

[2]  Bela Bollobas,et al.  Graph theory , 1979 .

[3]  Carsten Thomassen,et al.  Planarity and duality of finite and infinite graphs , 1980, J. Comb. Theory B.

[4]  Carsten Thomassen,et al.  Nonseparating cycles in K-Connected graphs , 1981, J. Graph Theory.

[5]  Hikoe Enomoto,et al.  Contractible edges in 3-connected graphs , 1987, J. Comb. Theory, Ser. B.