Question: A graph G has order n=3k+3 for some positive integers k. Every vertex of G has degree k+1,k+2 or k+3.Prove that G has at least
A graph G has order n=3k+3 for some positive integers k. Every vertex of G has degree k+1,k+2 or k+3.Prove that G has at least k+3 vertices of degree k+1 or at least k+1 vertices of degree k+2 or at least k+2 vertices of degree k+3.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
