MHB How Many Unique Substructures Exist in an n-Clique?

  • Thread starter Thread starter Andrei1
  • Start date Start date
AI Thread Summary
The discussion centers on determining the number of unique substructures in an n-clique, denoted as K_n. For part (a), the answer of 2^n for the number of subgraphs is generally accepted, though some may argue for 2^n - 1 if excluding the empty graph. Part (b) is debated, as the correct interpretation of substructures leads to a conclusion that there are multiple unique structures, not simply n. Part (c) raises questions about the definition of elementary substructures, with clarification provided on the criteria for such structures. Overall, the conversation emphasizes the complexity of defining and counting substructures in graph theory.
Andrei1
Messages
36
Reaction score
0
Let $$K_n$$ be the $$n$$-clique for some $$n\in\mathbb{N}$$. Then any graph having at most $$n$$ vertices is a subgraph of $$K_n$$.
(a) How many substructures does $$K_n$$ have?
(b) How many substructures does $$K_n$$ have up to isomorphism?
(c) How many elementary substructures does $$K_n$$ have?
My answers:
(a) $$2^n$$
(b) $$n$$
(c) $$2^n$$
Are they correct?
 
Physics news on Phys.org
Andrei said:
My answers:
(a) $$2^n$$
(b) $$n$$
(c) $$2^n$$
Are they correct?
If by substructures you mean subgraph, then the answer to part (a) looks okay. Some people may write $2^n-1$ because they might not want to include $\emptyset$ in the list.

For the second, is the question asking to find out the number of graphs, up to isomorphism, having at most $n$ vertices. In that case, the answer cannot be just $n$.

For part (c), I don't know the definition of elementary substructures. Can you please define it?
 
$$M$$ is a substructure of $$N$$ ... if
1. $$M$$ is a structure having the same vocabulary as $$N$$,
2. the underlying set $$U_M$$ of $$M$$ is a subset of the underlying set $$U_N$$ of $$N$$, and
3. $$M$$ interprets the vocabulary in the same manner as $$N$$ on $$U_M$$.

Let $$N$$ and $$M$$ be structures in the same vocabulary. Then $$M$$ is an elementary substructure of $$N$$ ... if and only if the identity function $$id\colon M\to N$$ defined by $$id(x)=x$$ is an elementary embedding [preserves all formulas].

About (b). Let's take a 4-clique. Any subgraph of it is not a substructure if it is not a clique. So I have, up to isomorphism, 4 substrucutures: one 1-clique, one 2-clique, ...
 
Andrei said:
About (b). Let's take a 4-clique. Any subgraph of it is not a substructure if it is not a clique. So I have, up to isomorphism, 4 substrucutures: one 1-clique, one 2-clique, ...
Then by substructures you do not means subgraphs. It's fine then.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top