Hey I'm having a bit of bother with this question:
"Let G be a graph on n >= 5 vertices and with minimal degree δ(G) > 3n/4. Show that G contains a copy of K(5). (The complete graph of 5 vertices)
Any help is greatly appreciated!
Hey I'm having a bit of bother with this question:
"Let G be a graph on n >= 5 vertices and with minimal degree δ(G) > 3n/4. Show that G contains a copy of K(5). (The complete graph of 5 vertices)
Any help is greatly appreciated!