• Dec 7th 2012, 11:41 AM
kakatomy
1. Fix n 3 to be an integer. How many graphs are there that aresub-graphs of Kn (assume that all nodes are different and included in the sub-graph)?

Thanks Brothers !
• Dec 7th 2012, 12:00 PM
Plato
Quote:

Originally Posted by kakatomy
Fix n ≥ 3 to be an integer. How many graphs are there that are sub-graphs of Kn (assume that all nodes are different and included in the sub-graph)?

I not sure that I understand that statement.

There are $2^n-1$ non-empty subsets of vertices.

If we chose a subset of vertices and include any edge between any two of them, then that is the number of sub-graphs.

Now some authors do not allow single vertex sub-graphs.
In that case we use the number $2^n-n-1.$
• Dec 14th 2012, 11:40 PM
skeptopotamus
Hi, if that is the wording of your problem, with the "fix $n \geq 3$," then I think something is missing, because the solution does not depend on $n \geq 3$ at all. Do you mean connected subgraphs? Do you include the order-zero graph?