OpenStax, Contemporary Mathematics §12.2 Graph Structures · Example 2 · Combinatorics · Graph theory

Graph Structures · Example 2

Use the Sum of Degrees Theorem to determine the number of introductions required in a room with

(a) 6 strangers.
(b) 10 strangers.
(c) $n$ strangers.

~5 minWritten answer · compare with the solution

OpenStax, Contemporary Mathematics · §12.2 Graph Structures · Example 2

Stuck? A gentle nudge

No hints for this one.

Something off?

Workspace

Your working

Check your full solution

Upload photos of your handwritten work or a PDF, and Lemma will read it and tell you whether it's right — and where it first goes wrong if not.