Abstract
It is proved that a graph of order n contains a triangle if | N ( X )|> 1 3 ( n +| X |) for every independent set X of vertices. This bound is sharp.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
