A Private Exhibition of Networked Curiosities
Wherein the Fundamental Curiosities of Graph Theory Are Displayed
In the cartographer's lexicon, every landmark is a vertex and every road between them an edge. A graph is simply the most honest map ever drawn — stripped of terrain, weather, and ornamentation, it reveals only the essential truth: what connects to what.
Consider a map of medieval trade routes. Each city — Venice, Constantinople, Samarkand — is a vertex humming with potential energy. Each caravan trail connecting them is an edge carrying the weight of silk, spice, and stories. The graph beneath the map is the skeleton of commerce itself.
The number of edges touching a vertex. In cartographic terms: how many roads lead to Rome?
A walk through a graph is like tracing a finger along a map's winding roads — you may revisit crossroads, retrace your steps, meander. But a path is a journey of discipline: each vertex visited exactly once.
Euler himself posed the question in Königsberg: can one cross every bridge exactly once? The answer, famously, was no — but the question launched an entirely new cartography of the abstract.
A connected graph is a territory with no isolated islands. From any vertex, you can reach any other.
A cycle is a journey that returns to where it began — a closed loop through the graph's territory. Think of a medieval wall surrounding a city: you can walk its full perimeter and arrive back at your starting gate.
The presence or absence of cycles defines entire families of graphs. Trees are defined precisely by their refusal to cycle. Remove any edge from a cycle and the territory remains connected; remove an edge from a tree and it fractures into islands.
Territories of Abstract Connection
Graph theory is, at its heart, a cartography of the invisible. Where the traditional mapmaker charts coastlines and mountain ranges, the graph theorist maps relationships — the unseen threads that bind entities into networks, communities, and systems.
Consider the social networks that existed long before their digital incarnations. Every letter sent between correspondents in the 18th century traced an edge in a vast, invisible graph. The small-world phenomenon — the surprising truth that most people are connected by remarkably few intermediaries — was a property of human graphs long before anyone thought to measure it.
The beauty of graph theory lies in its generality. The same theorems that describe electrical circuits describe social networks. A graph is a universal language for describing connection — arguably the most fundamental concept in mathematics, science, and human experience.
In this map room, we chart not physical territories but conceptual ones. Each theorem is a landmark. Each proof is a surveyor's measurement. And the grand map that emerges — the interconnected web of graph-theoretic knowledge — is itself a graph of extraordinary beauty and complexity.
A Cabinet of Graph-Theoretic Curiosities
The minimum colors needed so no two adjacent vertices share a hue.
A subgraph that reaches every vertex using the fewest possible edges.
Two graphs that look different but share the same structure underneath.
Every graph is a map of relationships.
Every map is a story of connections.