Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Interesting graph theory problem

  1. Oct 21, 2013 #1
    I have the following problem, suppose we have a graph G of n elements, with the property that if we add one missing vertex v, we will get a complete subgraph with s elements K_s of G, in which v belongs to G'. In other words every subgraph of s elements of G is almost a complete graph except for at most one missing vertex. (s is fixed btw).

    The problem is to prove that |E(G)| >= C(n,2) - C(n-s+2,2), |E(G)| is the number of edges of G. C(n,k) is the binomial coeficient.

    I am not sure if this is the appropiate forum for this kind of questions, but couldn't find any adequate subforum.

    Any help is appreciated.
     
  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?
Draft saved Draft deleted



Similar Discussions: Interesting graph theory problem
  1. Graph theory problem (Replies: 0)

  2. Graph theory (Replies: 5)

  3. Graph theory (Replies: 10)

  4. Graph Theory (Replies: 3)

  5. Graph Theory (Replies: 1)

Loading...