Title of article :
Triangles and Neighbourhoods of Independent Sets in Graphs
Author/Authors :
Robertshaw، نويسنده , , Andrew M. and Woodall، نويسنده , , Douglas R.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2000
Abstract :
It is proved that a graph of order n contains a triangle if |N(X)|>13(n+|X|) for every independent set X of vertices. This bound is sharp.
Keywords :
binding number , Triangle-free graph , neighbourhood condition , pancyclic graph
Journal title :
Journal of Combinatorial Theory Series B
Journal title :
Journal of Combinatorial Theory Series B
