# Erdős number

The **Erdős number** (Hungarian: [ˈɛrdøːʃ]) describes the "collaborative distance" between mathematician Paul Erdős and another person, as measured by authorship of mathematical papers. The same principle has been applied in other fields where a particular individual has collaborated with a large and broad number of peers.

## Overview[edit]

Paul Erdős (1913–1996) was an influential Hungarian mathematician who in the latter part of his life spent a great deal of time writing papers with a large number of colleagues—over 500—working on solutions to outstanding mathematical problems.^{[1]} He published more papers during his lifetime (at least 1,525^{[2]}) than any other mathematician in history.^{[1]} (Leonhard Euler published more total pages of mathematics but fewer separate papers: about 800.)^{[3]} Erdős spent most of his career with no permanent home or job. He traveled with everything he owned in two suitcases, and would visit mathematicians he wanted to collaborate with, often unexpectedly, and expect to stay with them.^{[4]}^{[5]}^{[6]}

The idea of the Erdős number was originally created by the mathematician's friends as a tribute to his enormous output. Later it gained prominence as a tool to study how mathematicians cooperate to find answers to unsolved problems. Several projects are devoted to studying connectivity among researchers, using the Erdős number as a proxy.^{[7]} For example, Erdős collaboration graphs can tell us how authors cluster, how the number of co-authors per paper evolves over time, or how new theories propagate.^{[8]}

Several studies have shown that leading mathematicians tend to have particularly low Erdős numbers (i.e. high proximity).^{[9]} The median Erdős number of Fields Medalists is 3. Only 7,097 (about 5% of mathematicians with a collaboration path) have an Erdős number of 2 or lower.^{[10]} As time passes, the lowest Erdős number that can still be achieved will necessarily increase, as mathematicians with low Erdős numbers die and become unavailable for collaboration. Still, historical figures can have low Erdős numbers. For example, renowned Indian mathematician Srinivasa Ramanujan has an Erdős number of only 3 (through G. H. Hardy, Erdős number 2), even though Paul Erdős was only 7 years old when Ramanujan died.^{[11]}

## Definition and application in mathematics[edit]

To be assigned an Erdős number, someone must be a coauthor of a research paper with another person who has a finite Erdős number. Paul Erdős himself is assigned an Erdős number of zero. A certain author's Erdős number is one greater than the lowest Erdős number of any of their collaborators; for example an author who has coauthored a publication with Erdős would have an Erdős number of 1. The American Mathematical Society provides a free online tool to determine the collaboration distance between two mathematical authors listed in the *Mathematical Reviews* catalogue.^{[11]}

Erdős wrote around 1,500 mathematical articles in his lifetime, mostly co-written. He had 509 direct collaborators;^{[7]} these are the people with Erdős number 1. The people who have collaborated with them (but not with Erdős himself) have an Erdős number of 2 (12,600 people as of 7 August 2020^{[12]}), those who have collaborated with people who have an Erdős number of 2 (but not with Erdős or anyone with an Erdős number of 1) have an Erdős number of 3, and so forth. A person with no such coauthorship chain connecting to Erdős has an Erdős number of infinity (or an undefined one). Since the death of Paul Erdős, the lowest Erdős number that a new researcher can obtain is 2.

There is room for ambiguity over what constitutes a link between two authors. The American Mathematical Society collaboration distance calculator uses data from *Mathematical Reviews*, which includes most mathematics journals but covers other subjects only in a limited way, and which also includes some non-research publications. The Erdős Number Project web site says:

... One drawback of the MR system is that it considers all jointly authored works as providing legitimate links, even articles such as obituaries, which are not really joint research. ...

^{[13]}

It also says:

... Our criterion for inclusion of an edge between vertices u and v is some research collaboration between them resulting in a published work. Any number of additional co-authors is permitted,...

but excludes non-research publications such as elementary textbooks, joint editorships, obituaries, and the like. The "Erdős number of the second kind" restricts assignment of Erdős numbers to papers with only two collaborators.^{[14]}

The Erdős number was most likely first defined in print by Casper Goffman, an analyst whose own Erdős number is 2.^{[12]} Goffman published his observations about Erdős' prolific collaboration in a 1969 article entitled "*And what is your Erdős number?*"^{[15]} See also some comments in an obituary by Michael Golomb.^{[16]}

The median Erdős number among Fields medalists is as low as 3.^{[10]} Fields medalists with Erdős number 2 include Atle Selberg, Kunihiko Kodaira, Klaus Roth, Alan Baker, Enrico Bombieri, David Mumford, Charles Fefferman, William Thurston, Shing-Tung Yau, Jean Bourgain, Richard Borcherds, Manjul Bhargava, Jean-Pierre Serre and Terence Tao. There are no Fields medalists with Erdős number 1;^{[17]} however, Endre Szemerédi is an Abel Prize Laureate with Erdős number 1.^{[9]}

## Most frequent Erdős collaborators[edit]

While Erdős collaborated with hundreds of co-authors, there were some individuals with whom he co-authored dozens of papers. This is a list of the ten persons who most frequently co-authored with Erdős and their number of papers co-authored with Erdős (i.e. their number of collaborations).^{[18]}

Co-author | Number of collaborations |
---|---|

András Sárközy | 62 |

András Hajnal | 56 |

Ralph Faudree | 50 |

Richard Schelp | 42 |

Cecil C. Rousseau | 35 |

Vera T. Sós | 35 |

Alfréd Rényi | 32 |

Pál Turán | 30 |

Endre Szemerédi | 29 |

Ronald Graham | 28 |

## Related fields[edit]

As of 2022^{[update]}, all Fields Medalists have a finite Erdős number, with values that range between 2 and 6, and a median of 3. In contrast, the median Erdős number across all mathematicians (with a finite Erdős number) is 5, with an extreme value of 13.^{[19]} The table below summarizes the Erdős number statistics for Nobel prize laureates in Physics, Chemistry, Medicine, and Economics.^{[20]} The first column counts the number of laureates. The second column counts the number of winners with a finite Erdős number. The third column is the percentage of winners with a finite Erdős number. The remaining columns report the minimum, maximum, average, and median Erdős numbers among those laureates.

#Laureates | #Erdős | %Erdős | Min | Max | Average | Median | |
---|---|---|---|---|---|---|---|

Fields Medal | 56 | 56 | 100.0% | 2 | 6 | 3.36 | 3 |

Nobel Economics | 76 | 47 | 61.84% | 2 | 8 | 4.11 | 4 |

Nobel Chemistry | 172 | 42 | 24.42% | 3 | 10 | 5.48 | 5 |

Nobel Medicine | 210 | 58 | 27.62% | 3 | 12 | 5.50 | 5 |

Nobel Physics | 200 | 159 | 79.50% | 2 | 12 | 5.63 | 5 |

### Physics[edit]

Among the Nobel Prize laureates in Physics, Albert Einstein and Sheldon Glashow have an Erdős number of 2. Nobel Laureates with an Erdős number of 3 include Enrico Fermi, Otto Stern, Wolfgang Pauli, Max Born, Willis E. Lamb, Eugene Wigner, Richard P. Feynman, Hans A. Bethe, Murray Gell-Mann, Abdus Salam, Steven Weinberg, Norman F. Ramsey, Frank Wilczek, and David Wineland. Fields Medal-winning physicist Ed Witten has an Erdős number of 3.^{[10]}

### Biology[edit]

Computational biologist Lior Pachter has an Erdős number of 2.^{[21]} Evolutionary biologist Richard Lenski has an Erdős number of 3, having co-authored a publication with Lior Pachter and with mathematician Bernd Sturmfels, each of whom has an Erdős number of 2.^{[22]}

### Finance and economics[edit]

There are at least two winners of the Nobel Prize in Economics with an Erdős number of 2: Harry M. Markowitz (1990) and Leonid Kantorovich (1975). Other financial mathematicians with Erdős number of 2 include David Donoho, Marc Yor, Henry McKean, Daniel Stroock, and Joseph Keller.

Nobel Prize laureates in Economics with an Erdős number of 3 include Kenneth J. Arrow (1972), Milton Friedman (1976), Herbert A. Simon (1978), Gerard Debreu (1983), John Forbes Nash, Jr. (1994), James Mirrlees (1996), Daniel McFadden (2000), Daniel Kahneman (2002), Robert J. Aumann (2005), Leonid Hurwicz (2007), Roger Myerson (2007), Alvin E. Roth (2012), and Lloyd S. Shapley (2012) and Jean Tirole (2014).^{[23]}

Some investment firms have been founded by mathematicians with low Erdős numbers, among them James B. Ax of Axcom Technologies, and James H. Simons of Renaissance Technologies, both with an Erdős number of 3.^{[24]}^{[25]}

### Philosophy[edit]

Since the more formal versions of philosophy share reasoning with the basics of mathematics, these fields overlap considerably, and Erdős numbers are available for many philosophers.^{[26]} Philosophers John P. Burgess and Brian Skyrms have an Erdős number of 2.^{[12]} Jon Barwise and Joel David Hamkins, both with Erdős number 2, have also contributed extensively to philosophy, but are primarily described as mathematicians.

### Law[edit]

Judge Richard Posner, having coauthored with Alvin E. Roth, has an Erdős number of at most 4. Roberto Mangabeira Unger, a politician, philosopher, and legal theorist who teaches at Harvard Law School, has an Erdős number of at most 4, having coauthored with Lee Smolin.

### Politics[edit]

Angela Merkel, Chancellor of Germany from 2005 to 2021, has an Erdős number of at most 5.^{[17]}

### Engineering[edit]

Some fields of engineering, in particular communication theory and cryptography, make direct use of the discrete mathematics championed by Erdős. It is therefore not surprising that practitioners in these fields have low Erdős numbers. For example, Robert McEliece, a professor of electrical engineering at Caltech, had an Erdős number of 1, having collaborated with Erdős himself.^{[27]} Cryptographers Ron Rivest, Adi Shamir, and Leonard Adleman, inventors of the RSA cryptosystem, all have Erdős number 2.^{[21]}

### Linguistics[edit]

The Romanian mathematician and computational linguist Solomon Marcus had an Erdős number of 1 for a paper in *Acta Mathematica Hungarica* that he co-authored with Erdős in 1957.^{[28]}

## Impact[edit]

Erdős numbers have been a part of the folklore of mathematicians throughout the world for many years. Among all working mathematicians at the turn of the millennium who have a finite Erdős number, the numbers range up to 15, the median is 5, and the mean is 4.65;^{[7]} almost everyone with a finite Erdős number has a number less than 8. Due to the very high frequency of interdisciplinary collaboration in science today, very large numbers of non-mathematicians in many other fields of science also have finite Erdős numbers.^{[29]} For example, political scientist Steven Brams has an Erdős number of 2. In biomedical research, it is common for statisticians to be among the authors of publications, and many statisticians can be linked to Erdős via John Tukey, who has an Erdős number of 2. Similarly, the prominent geneticist Eric Lander and the mathematician Daniel Kleitman have collaborated on papers,^{[30]}^{[31]} and since Kleitman has an Erdős number of 1,^{[32]} a large fraction of the genetics and genomics community can be linked via Lander and his numerous collaborators. Similarly, collaboration with Gustavus Simmons opened the door for
Erdős numbers within the cryptographic research community, and many linguists have finite Erdős numbers, many due to chains of collaboration with such notable scholars as Noam Chomsky (Erdős number 4),^{[33]} William Labov (3),^{[34]} Mark Liberman (3),^{[35]} Geoffrey Pullum (3),^{[36]} or Ivan Sag (4).^{[37]} There are also connections with arts fields.^{[38]}

According to Alex Lopez-Ortiz, all the Fields and Nevanlinna prize winners during the three cycles in 1986 to 1994 have Erdős numbers of at most 9.

Earlier mathematicians published fewer papers than modern ones, and more rarely published jointly written papers. The earliest person known to have a finite Erdős number is either Antoine Lavoisier (born 1743, Erdős number 13), Richard Dedekind (born 1831, Erdős number 7), or Ferdinand Georg Frobenius (born 1849, Erdős number 3), depending on the standard of publication eligibility.^{[39]}

Martin Tompa^{[40]} proposed a directed graph version of the Erdős number problem, by orienting edges of the collaboration graph from the alphabetically earlier author to the alphabetically later author and defining the *monotone Erdős number* of an author to be the length of a longest path from Erdős to the author in this directed graph. He finds a path of this type of length 12.

Also, Michael Barr suggests "rational Erdős numbers", generalizing the idea that a person who has written *p* joint papers with Erdős should be assigned Erdős number 1/*p*.^{[41]} From the collaboration multigraph of the second kind (although he also has a way to deal with the case of the first kind)—with one edge between two mathematicians for *each* joint paper they have produced—form an electrical network with a one-ohm resistor on each edge. The total resistance between two nodes tells how "close" these two nodes are.

It has been argued that "for an individual researcher, a measure such as Erdős number captures the structural properties of [the] network whereas the *h*-index captures the citation impact of the publications," and that "One can be easily convinced that ranking in coauthorship networks should take into account both measures to generate a realistic and acceptable ranking."^{[42]}

In 2004 William Tozier, a mathematician with an Erdős number of 4 auctioned off a co-authorship on eBay, hence providing the buyer with an Erdős number of 5. The winning bid of $1031 was posted by a Spanish mathematician, who refused to pay and only placed the bid to stop what he considered a mockery.^{[43]}^{[44]}

## Variations[edit]

A number of variations on the concept have been proposed to apply to other fields, notably the Bacon number (as in the game Six Degrees of Kevin Bacon), connecting actors to the actor Kevin Bacon by a chain of joint appearances in films. It was created in 1994, 25 years after Goffman's article on the Erdős number.

A small number of people are connected to both Erdős and Bacon and thus have an Erdős–Bacon number, which combines the two numbers by taking their sum. One example is the actress-mathematician Danica McKellar, best known for playing Winnie Cooper on the TV series *The Wonder Years*.
Her Erdős number is 4,^{[45]} and her Bacon number is 2.^{[46]}

Further extension is possible. For example, the "Erdős–Bacon–Sabbath number" is the sum of the Erdős–Bacon number and the collaborative distance to the band Black Sabbath in terms of singing in public. Physicist Stephen Hawking had an Erdős–Bacon–Sabbath number of 8,^{[47]} and actress Natalie Portman has one of 11 (her Erdős number is 5).^{[48]}

In chess, the Morphy number describes a player's connection to Paul Morphy, widely considered the greatest chess player of his time and an unofficial World Chess Champion.^{[49]}

In go, the Shusaku number describes a player's connection to Honinbo Shusaku, the strongest player of his time.^{[50]}^{[51]}

In video games, the Ryu number describes a video game character's connection to the Street Fighter character Ryu.^{[52]}^{[53]}

## See also[edit]

- Author-level metrics – Metrics of the bibliometric impact of individual authors
- Collaboration graph – Graph modeling collaboration in a social network
- List of people by Erdős number
- List of things named after Paul Erdős
- Scientometrics – Quantitative study of scholarly literature
- Six degrees of separation – Concept of social inter-connectedness of all people
- Small-world experiment – Experiments examining the average path length for social networks
- Small-world network – Graph where most nodes are reachable in a small number of steps
- Sociology of scientific knowledge – Study of science as a social activity

## References[edit]

- ^
^{a}^{b}Newman, Mark E. J. (2001). "The structure of scientific collaboration networks".*Proceedings of the National Academy of Sciences of the United States of America*.**98**(2): 404–409. doi:10.1073/pnas.021544898. PMC 14598. PMID 11149952. **^**Grossman, Jerry. "Publications of Paul Erdős". Retrieved 1 Feb 2011.**^**"Frequently Asked Questions".*The Euler Archive*. Dartmouth College.**^**Cofield, Calla (26 March 2013). "An Arbitrary Number of Years Since Mathematician Paul Erdős's Birth".*Scientific American*.**^**Krauthammer, Charles (27 September 1996). "Paul Erdos" (PostScript file).*The Washington Post*. p. A25. File available as HTML via Solipsys**^**Bruno, Leonard C. (2003) [1999].*Math and mathematicians: the history of math discoveries around the world*. Baker, Lawrence W. Detroit, Mich.: U X L. ISBN 978-0787638139. OCLC 41497065.- ^
^{a}^{b}^{c}"Facts about Erdös Numbers and the Collaboration Graph". Oakland University. **^**"Facts about Erdös Numbers and the Collaboration Graph".*Erdös Number Project*. Oakland University.- ^
^{a}^{b}De Castro, Rodrigo; Grossman, Jerrold W. (1999). "Famous trails to Paul Erdős" (PDF).*The Mathematical Intelligencer*.**21**(3): 51–63. doi:10.1007/BF03025416. MR 1709679. S2CID 120046886. Archived from the original (PDF) on 2015-09-24. Original Spanish version in*Rev. Acad. Colombiana Cienc. Exact. Fís. Natur.***23**(89) 563–582, 1999, MR1744115. - ^
^{a}^{b}^{c}"Some Famous People with Finite Erdős Numbers". oakland.edu. Retrieved 4 April 2014. - ^
^{a}^{b}"Collaboration Distance".*MathSciNet*. American Mathematical Society. - ^
^{a}^{b}^{c}Erdos2, Version 2020, 7 August 2020. **^**"Compute your Erdös number - The Erdös Number Project".*Oakland University*. 1999-02-22. Retrieved 2022-10-15.**^**Grossman*et al.*"Erdős numbers of the second kind," in*Facts about Erdős Numbers and the Collaboration Graph*. The Erdős Number Project, Oakland University, USA. Retrieved July 25, 2009.**^**Goffman, Casper (1969). "And what is your Erdős number?".*American Mathematical Monthly*.**76**(7): 791. doi:10.2307/2317868. JSTOR 2317868.**^**"Paul Erdös at Purdue".*www.math.purdue.edu*.- ^
^{a}^{b}"Paths to Erdös".*The Erdös Number Project*. Oakland University. **^**Grossman, Jerry, Erdos0p, Version 2010,*The Erdős Number Project*, Oakland University, US, October 20, 2010.**^**"Facts about Erdös Numbers and the Collaboration Graph - The Erdös Number Project- Oakland University".*wwwp.oakland.edu*. Retrieved 2016-10-27.**^**López de Prado, Marcos (2016). "Mathematics and Economics: A reality check".*The Journal of Portfolio Management*.**43**(1): 5–8. doi:10.3905/jpm.2016.43.1.005. S2CID 219231926.- ^
^{a}^{b}"List of all people with Erdos number less than or equal to 2".*The Erdös Number Project*. Oakland University. 14 July 2015. Retrieved 25 August 2015. **^**Richard Lenski (May 28, 2015). "Erdös with a non-kosher side of Bacon".**^**Grossman, J. (2015): "The Erdős Number Project." http://wwwp.oakland.edu/enp/erdpaths/**^**Kishan, Saijel (2016-11-11). "Six Degrees of Quant: Kevin Bacon and the Erdős Number Mystery".*Bloomberg.com*. Retrieved 2016-11-12.**^**Bailey, David H. (2016-11-06). "Erdős Numbers: A True "Prince and the Pauper" story".*The Mathematical Investor*. Retrieved 2016-11-12.**^**Toby Handfield. "Philosophy research networks" (PDF). Archived from the original (PDF) on 2016-02-21.**^**Erdős, Paul; McEliece, Robert James; Taylor, Herbert (1971). "Ramsey bounds for graph products" (PDF).*Pacific Journal of Mathematics*.**37**(1): 45–46. doi:10.2140/pjm.1971.37.45.**^**Erdős, Paul; Marcus, Solomon (1957). "Sur la décomposition de l'espace euclidien en ensembles homogènes" [On the decomposition of the Euclidean space into homogeneous sets].*Acta Mathematica Hungarica*.**8**(3–4): 443–452. doi:10.1007/BF02020326. MR 0095456. S2CID 121671198.**^**Grossman, Jerry. "Some Famous People with Finite Erdős Numbers". Retrieved 1 February 2011.**^**Pachter, L; Batzoglou, S; Spitkovsky, VI; Banks, E; Lander, ES; Kleitman, DJ; Berger, B (1999). "A dictionary-based approach for gene annotation".*J Comput Biol*.**6**(3–4): 419–30. doi:10.1089/106652799318364. PMID 10582576.**^**Kleitman, Daniel. "Publications Since 1980 more or less". Massachusetts Institute of Technology.**^**Erdős, Paul; Kleitman, Daniel (April 1971). "On Collections of Subsets Containing No 4-Member Boolean Algebra" (PDF).*Proceedings of the American Mathematical Society*.**28**(1): 87–90. doi:10.2307/2037762. JSTOR 2037762.**^**von Fintel, Kai (2004). "My Erdös Number is 8". Semantics, Inc. Archived from the original on 23 August 2006.**^**"Aaron Dinkin has a web site?". Ling.upenn.edu. Retrieved 2010-08-29.**^**"Mark Liberman's Home Page". Ling.upenn.edu. Retrieved 2010-08-29.**^**"Christopher Potts: Miscellany". Stanford.edu. Retrieved 2010-08-29.**^**"Bob's Erdős Number". Lingo.stanford.edu. Archived from the original on 2016-04-05. Retrieved 2010-08-29.**^**Bowen, Jonathan P.; Wilson, Robin J. (10–12 July 2012). "Visualising Virtual Communities: From Erdős to the Arts". In Dunn, Stuart; Bowen, Jonathan P.; Ng, Kia (eds.).*EVA London 2012: Electronic Visualisation and the Arts*. Electronic Workshops in Computing. British Computer Society. pp. 238–244.**^**"Paths to Erdös - The Erdös Number Project- Oakland University".*oakland.edu*.**^**Tompa, Martin (1989). "Figures of merit".*ACM SIGACT News*.**20**(1): 62–71. doi:10.1145/65780.65782. S2CID 34277380. Tompa, Martin (1990). "Figures of merit: the sequel".*ACM SIGACT News*.**21**(4): 78–81. doi:10.1145/101371.101376. S2CID 14144008.**^**Barr, Michael. "Rational Erdős numbers".**^**Kashyap Dixit, S Kameshwaran, Sameep Mehta, Vinayaka Pandit, N Viswanadham,*Towards simultaneously exploiting structure and outcomes in interaction networks for node ranking Archived 2011-11-10 at the Wayback Machine*, IBM Research Report R109002, February 2009; also appeared as Kameshwaran, S.; Pandit, V.; Mehta, S.; Viswanadham, N.; Dixit, K. (2010). "Outcome aware ranking in interaction networks".*Proceedings of the 19th ACM international conference on Information and knowledge management*. pp. 229–238. doi:10.1145/1871437.1871470. ISBN 978-1-4503-0099-5. S2CID 16370569.**^**Clifford A. Pickover:*A Passion for Mathematics: Numbers, Puzzles, Madness, Religion, and the Quest for Reality*. Wiley, 2011, ISBN 9781118046074, S. 33 (*excerpt*, p. 33, at Google Books)**^**Klarreich, Erica (2004). "Theorem for Sale".*Science News*.**165**(24): 376–377. doi:10.2307/4015267. JSTOR 4015267.**^**McKellar's co-author Lincoln Chayes published a paper with Elliott H. Lieb, who in turn co-authored a paper with Daniel Kleitman, a co-author of Paul Erdős.**^**Danica McKellar was in*The Year That Trembled*(2002) with James Kisicki, who was in*Telling Lies in America*(1997) with Kevin Bacon.**^**Fisher, Len (2016-02-17). "What's your Erdős–Bacon–Sabbath number?".*Times Higher Education*. Retrieved 2018-07-29.**^**Sear, Richard (2012-09-15). "Erdős–Bacon–Sabbath numbers".*Department of Physics, University of Surrey*. Retrieved 2018-07-29.**^**Kingston, Taylor. "Your Morphy Number Is Up" (PDF).*Chesscafe*. Archived (PDF) from the original on 13 June 2006. Retrieved 9 December 2020.**^**"Shusaku Number". Retrieved 2023-04-07.**^**"Shusaku Numbers". Retrieved 2023-04-07.**^**McWhertor, Michael (November 22, 2021). "Street Fighter's Ryu and Chun-Li join Ubisoft's take on Smash Bros., Brawlhalla". Polygon. Retrieved December 3, 2022.**^**Walker, Ian (June 22, 2021). "Street Fighter's Ryu Is The Kevin Bacon Of Video Games". Kotaku. Retrieved December 3, 2022.

## External links[edit]

- Jerry Grossman, The Erdős Number Project. Contains statistics and a complete list of all mathematicians with an Erdős number less than or equal to 2.
- New Erdős Number Project website Migration to new site in 2021.
- "On a Portion of the Well-Known Collaboration Graph", Jerrold W. Grossman and Patrick D. F. Ion.
- "Some Analyses of Erdős Collaboration Graph", Vladimir Batagelj and Andrej Mrvar.
- American Mathematical Society, MR free tools: collaboration distance. A search engine for Erdős numbers and collaboration distance between other authors.
- Numberphile video. Ronald Graham on imaginary Erdős numbers.