Question: Let G be a graph such that every vertex in G has degree at least 7, and G contains no cycles of length 3.

Let G be a graph such that every vertex in G has degree at least 7, and G contains no cycles of length 3. Prove that G has at least 14 vertices. (Here, "graph" means a simple undirected graph with no loops.)
Step by Step Solution
3.39 Rating (152 Votes )
There are 3 Steps involved in it
Lets suppose that G is a tree v be the number of vertices in G ... View full answer
Get step-by-step solutions from verified subject matter experts
