Results 1 to 3 of 3

Math Help - graph vertex colouring

  1. #1
    Junior Member
    Joined
    Apr 2010
    Posts
    33

    graph vertex colouring

    Show that any graph can be properly vertex-colored with (2m)^(1/2) colors, where m is the number of edges.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Newbie
    Joined
    Jan 2010
    Posts
    19
    I assume you meant ceil(sqrt(2m)). (The theorem's false if you take the floor instead.)

    The key lemma to prove first is that if G is colored optimally and c1 and c2 are two different colors, then there exists an edge between a vertex colored c1 and a vertex colored c2.

    Now consider an optimal coloring of G. Let c be the number of colors used. Then by the lemma there is an edge in G for each of the c(c-1)/2 possible pairs of colors, and obviously each of these edges are distinct. Thus c(c-1)/2 <= m.
    Manipulating this inequality gives
    sqrt(2m) >= sqrt(c(c-1))
    ceil(sqrt(2m)) >= ceil(sqrt(c(c-1))) = c, as desired.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Junior Member
    Joined
    Apr 2010
    Posts
    33
    thanks. That solves it.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Graph Theory- Edge Colouring
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: April 4th 2011, 12:20 AM
  2. vertex basis for the graph
    Posted in the Geometry Forum
    Replies: 2
    Last Post: June 7th 2010, 03:58 AM
  3. Graph theory - colouring
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: February 17th 2010, 08:26 PM
  4. colouring vertices in graph theory
    Posted in the Discrete Math Forum
    Replies: 5
    Last Post: December 3rd 2009, 03:53 PM
  5. n-vertex graph
    Posted in the Discrete Math Forum
    Replies: 5
    Last Post: November 25th 2009, 10:37 AM

/mathhelpforum @mathhelpforum