Let G be a graph with 100 vertices. The vertex set of G can be partitioned into ten sets
Chapter 0, Problem 3(choose chapter or problem)
Let G be a graph with 100 vertices. The vertex set of G can be partitioned into ten sets of ten vertices each; thus, V .G/ D W1 [ W2 [ [ W10: The Wis are pairwise disjoint and all have cardinality 10. In G there are no edges between vertices in the same Wi , but between Wi and Wj (with i 6D j ) all possible edges are present. How many edges does G have?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer