How Many Substructures Can Be Found in Complete Graphs K_n?

  • Thread starter Thread starter sara15
  • Start date Start date
  • Tags Tags
    Logic
sara15
Messages
14
Reaction score
0
If we have K_n denote the complete graph on n vertices, can anyone explain to me how to know how many substructures does K_n have?
 
Physics news on Phys.org
sara15 said:
If we have K_n denote the complete graph on n vertices, can anyone explain to me how to know how many substructures does K_n have?

Do you mean how many sub graphs does it have? If so, how many subsets of n verticies is there?
 
Robert1986 said:
Do you mean how many sub graphs does it have? If so, how many subsets of n verticies is there?

yes it means a subgraph
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...

Similar threads

Back
Top