1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Graph Proof

  1. Mar 7, 2013 #1
    1. The problem statement, all variables and given/known data
    Let G be a graph. Let ω(G) be the size o the largest independent set of G. Let χ(G) be the chromatic number of G. If g has n verticies, show ω(G)χ(G) >= n.

    2. Relevant equations
    There's no equations since this is a proof.


    3. The attempt at a solution
    I tried to do a direct proof by going though and sandwiching n between some other values, but then I realized that there was no way to claim n > x and n > z => z < x < n.
     
  2. jcsd
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?



Similar Discussions: Graph Proof
  1. A proof! (Replies: 0)

Loading...