Erdős number

The shortest number of collaborations with other mathematicians through which a particular mathematician can be connected to Paul Erdős is the Erdős number of that mathematician. For example, N. J. A. Sloane coauthored Sphere Packings, Lattices and Groups with John Horton Conway. In turn, Conway coauthored a paper with Erdős in 1979, thus Sloane’s Erdős number is 2. Since Erdős died in 1996, 2 is the lowest Erdős number a mathematician working today can achieve.

One way to visualize the Erdős number is by drawing up a collaboration graph $G$ whose vertex set consists of all persons, where two vertices $x$ and $y$ are connected by an edge if and only if $x$ and $y$ have a joint publication. Then the Erdős number of a person $x$ is the distance in $G$ (possibly infinity) of $x$ from Erdős.

单词	ErdHosNumber
释义	Erdős number The shortest number of collaborations with other mathematicians through which a particular mathematician can be connected to Paul Erdős is the Erdős number of that mathematician. For example, N. J. A. Sloane coauthored Sphere Packings, Lattices and Groups with John Horton Conway. In turn, Conway coauthored a paper with Erdős in 1979, thus Sloane’s Erdős number is 2. Since Erdős died in 1996, 2 is the lowest Erdős number a mathematician working today can achieve. One way to visualize the Erdős number is by drawing up a collaboration graph $G$ whose vertex set consists of all persons, where two vertices $x$ and $y$ are connected by an edge if and only if $x$ and $y$ have a joint publication. Then the Erdős number of a person $x$ is the distance in $G$ (possibly infinity) of $x$ from Erdős.
随便看	ProofOfChromaticNumberAndGirth proof of chromatic number and girth ProofOfClarksonInequality proof of Clarkson inequality ProofOfClassEquationTheorem proof of class equation theorem ProofOfClassificationOfSeparableHilbertSpaces proof of classification of separable Hilbert spaces ProofOfClosedCurveTheorem proof of closed curve theorem ProofOfClosedDifferentialFormsOnASimpleConnectedDomain proof of closed differential forms on a simple connected domain ProofOfClosedGraphTheorem proof of closed graph theorem ProofOfCofactorExpansion proof of cofactor expansion ProofOfCompactnessTheoremForFirstOrderLogic proof of compactness theorem for first order logic ProofOfCompactPavingsAreClosedSubsetsOfACompactSpace proof of compact pavings are closed subsets of a compact space ProofOfComparisonTest proof of comparison test ProofOfCompletenessOfSemimartingaleConvergence proof of completeness of semimartingale convergence ProofOfCompletenessUnderUcpConvergence