I am working on graph theory assignment. I need help because I am not seeing where I am going with this question.
Here's the question: G is a simple graph with n vertices.
-> show that vertex colouring of G [ X(G) ]* vertex colouring of G complement >= n
-> show that the vertex...
Thanks! I got that proof. But I am still stuck on the second question as well. I played around with it.. but I have yet to get anywhere that is useful to prove the question.
I could really use some help.
I have a few questions I am having troubles with. If someone can push me in the right direction that would be awesome. Here are the questions:
1. Prove that the prime divisors, p cannot equal 3, of the integer n2-n+1 have the form 6k+1. (Hint: turn this into a statement about (-3/p) )
I was just working on some problems from a text book I own (for fun).
I am not sure how to start this problem at all.
Here's the question: Show that 3 is a quadratic non-residue of all Mersenne primes greater than 3.
I honestly don't know how to start. If I could get some help to push me...