What is an Erdős Number?
The Erdős number is a playful way to measure collaborative distance in academic publishing. Paul Erdős was an extraordinarily prolific mathematician who co-authored with hundreds of researchers. In this system, Erdős himself has number 0. Anyone who wrote a paper with him has number 1. If you wrote with someone who wrote with Erdős, you have number 2, and so on.
Why people care about it
The value is not prestige in itself; it is a neat graph-theory concept that illustrates how connected research communities can be. It is often used in conversations about networks, collaboration patterns, and the “small-world” nature of academia.
How this erdos calculator works
This page models co-authorship as a graph. Each person is a node, and each collaboration is an edge. The calculator uses a shortest-path search (breadth-first search) from Paul Erdős to the name you enter. If a path exists, the path length is your Erdős number in the current network.
- Built-in demo network: Includes a curated sample of well-known researchers for quick testing.
- Custom edges: Add your own names to explore hypothetical or personal collaboration chains.
- Path output: The result includes the chain of names that connects the target person to Erdős.
Important caveat
The built-in network on this page is a compact educational dataset, not a complete scholarly database. For authoritative results, you would need a comprehensive bibliographic source and strict author disambiguation. This tool is best used to understand the concept and experiment with network structure.
How to use the calculator effectively
- Enter a researcher name in the first input box.
- Leave the demo network enabled for quick results, or disable it if you want only your custom data.
- If needed, add custom co-author lines in the format Name A | Name B.
- Click Calculate Erdős Number to view both number and connection path.
Example scenarios
Try these names from the built-in network:
- Paul Erdős → expected number: 0
- Ronald Graham → expected number: 1
- Terence Tao → expected number: 2 in the demo graph
- Scott Aaronson → a longer path in the demo graph
Why this connects to graph theory and data science
Erdős numbers are really shortest-path computations on an undirected graph. That same idea appears in recommendation engines, fraud detection, social-network analysis, and routing problems. If you understand this calculator, you already understand a fundamental concept behind many real-world systems.