Let G be a graph such that every vertex in G has degree at least 7,...

Transcribed Image Text:

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.) 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.)

Answer rating: 100% (QA)

Lets suppose that G is a tree v be the number of vertices in G ... View the full answer