Explain 'Gerrymandering' from a graph theory perspective.

Explain 'Gerrymandering' from a graph theory perspective.

Approach: Describe partitioning a graph to favor a specific outcome.

The act of partitioning a graph (where nodes are neighborhoods/precincts) into connected subgraphs (districts) such that the resulting distribution of properties (voters) yields a biased outcome.

Follow-up: What is the 'isoperimetric inequality' used for in this context?

Key concepts: partitioning, connected components, compactness.