Graph theory: The idea
In plain words
The idea explained without jargon
A graph, in this sense, is a set of dots joined by lines: a network [3][11]. The dots might be islands, computers, towns or people, and the lines might be bridges, cables, roads or friendships. Graph theory studies what such a pattern allows, whatever its size or shape on paper. Euler's great step was to throw away everything that does not matter. Only the dots and which of them are joined count [3]. With that, questions become exact: can one walk along every line exactly once, which route between two dots is shortest, and how can all the dots be linked most cheaply? Euler showed that a walk using each line once exists only when no more than two dots have an odd number of lines meeting at them [1][3].
as of 2026-11-12
Key equation
The equation that sums it up, and what each symbol means
- Equation
- A connected network can be walked using every link exactly once only if 0 or 2 of its nodes have an odd number of links
- Symbols
- {"node":"a dot, such as a land mass, a router or a person","link":"a line joining two nodes, such as a bridge, a cable or a friendship","odd number of links":"the number of links meeting at a node is 1, 3, 5 and so on"}
- Note
- This idea has no single equation, so the law is given in words. In modern terms, Euler's conditions say that with more than two nodes of odd degree such a walk is impossible [1]; a graph with zero or two such nodes always has a path crossing every line once [3].
as of 2026-11-12
An analogy
A picture from everyday life that makes the idea easier to hold
A graph is like the map of a metro system. The map drops the real distances and bends of the track and keeps only which stations are joined, and that is enough to plan a journey. The picture stops being true when distance, time or cost matter: for those, each line needs a number attached to it, and finding the shortest or cheapest route becomes a harder problem.
as of 2026-11-12
Sources
- The Truth about Konigsberg The College Mathematics Journal 35(3), 198 to 207 (Brian Hopkins and Robin J. Wilson), 2004
- Maths in a minute: The bridges of Königsberg Plus Magazine, University of Cambridge
- graph theory Encyclopaedia Britannica