This voyage is an editorial path for understanding, not a claim of direct historical influence or sole invention.
Understand it in one breath
Abstract objects as vertices and relations as edges. Euler's 1736 paper on the Königsberg bridges was an early milestone because it kept only connectivity to decide whether a walk was possible. Social, communication, transport, and biological networks can be modeled as graphs, while real flows, directions, capacities, and time require additional structure.
At a glance
A
B
C
D
A
0
1
1
0
B
1
0
1
1
C
1
1
0
1
D
0
1
1
0
Adjacency matrix — A↔B, A↔C, B↔C, B↔D, C↔D. Each vertex’s degree equals its row sum (A:2, B:3, C:3, D:2). Total 10 = 5 edges × 2 ✓ by the Handshaking Lemma.
Concept
The mathematics of connection — born from a Sunday walk puzzle, now the language of social networks and the brain.
Key formula
v∈V∑deg(v)=2∣E∣(handshaking lemma)
Ports in time
This concept was not invented in one instant
Follow the scenes to see problems, notation, standards of proof, and applications changing across different times and places.
1
AD 1736Scene 1 / 4Königsberg
Euler — the bridges of Königsberg
Euler proved that no walk could cross each of Königsberg’s seven bridges exactly once, turning a city puzzle into the birth of graph theory.
AD 1852Scene 2 / 4Continue through the world of this year
The four-color conjecture
Could every planar map be colored with only four colors so that neighboring regions differ? The 1852 question was finally proved with computer assistance in 1976.
No reliable place is given, so time continues without an invented pin
AD 1959Scene 3 / 4Continue through the world of this year
Dijkstra — the shortest-path algorithm
Edsger Dijkstra devised an efficient method for finding shortest paths in a weighted graph. It became a foundation for routing, navigation, and network optimization.
No reliable place is given, so time continues without an invented pin