关于图的结合数的一个猜想

A Conjecture on the Binding Number in a Graph

本文对图论中的Woodall关于结合数的一个猜想作了研究,证明了:若图G的结合数,则图G包含三角形,从而较好地改进了文献[1]中的一个结果.

This essay is about a conjecture of the binding number to the woodall in a graph. It has been proved that if the bind number, in graph G, bind (G)≥(11+(185)^(1/2))/16, then graph G contains triangles. Thus it develops a result in document [1].