# Math Help - Prove G has a copy of K(5)

1. ## Prove G has a copy of K(5)

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!

2. ## Dr Talbot

Originally Posted by zara90
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)

I know that the degree is at least 4 for any given vertex from the equality but i don't know how to show that at least 5 vertices have this for the inequality. any help is greatly appreciated!
Hi, I see you are cheating and not doing your work by yourself.

See you tomorrow in lecture.

3. Originally Posted by zzzing
hi, i see you are cheating and not doing your work by yourself.

See you tomorrow in lecture.
loooooooooool