Skip to search formSkip to main contentSkip to account menu

Erdős number

Known as: Einstein number, Erdös number, Erdős numbers 
The Erdős number (Hungarian pronunciation: [ˈɛrdøːʃ]) describes the "collaborative distance" between mathematician Paul Erdős and another person, as… 
Wikipedia (opens in a new tab)

Related topics

Related topics

20 relations
András HajnalCecil C. RousseauCollaboration graphComputational biology

Broader (1)

Bibliometrics

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Hyperstructures, a New Approach to Complex Systems
We define a new concept, a hyperstructure, which is related to networks and hypernetworks and allows us to represent real… 
2010
2010
The Erdös-Ko-Rado theorem for twisted Grassmann graphs
We present a “modern” approach to the Erdös-Ko-Rado theorem for Q-polynomial distance-regular graphs and apply it to the twisted… 
2006
2006
A Basis for Systematic Analysis of Network Topologies: Technical Report
This paper presents a new, systematic approach to analyzing network topologies. We first introduce a series of probability… 
2006
2006
The Laplacian Spectrum of Complex Networks
The set of all eigenvalues of a characteristic matrix of a graph, also referred to as the spectrum, is a well-known topology… 
2005
2005
Refinement of Convergence Rates for Tail Probabilities
Let X1, X2,... be, i.i.d. random variables, and put $$ S_{n}=X_{1}+\cdots+X_{n}$$. We find necessary and sufficient moment… 
Highly Cited
2002
Highly Cited
2002
Connectivity distribution and attack tolerance of general networks with both preferential and random attachments
Highly Cited
2000
Highly Cited
2000
An extremal problem on the potentially Pk-graphic sequences
1999
1999
On a variant of the Erdős-Ginzburg-Ziv problem
(1) (0, . . . , 0, 1, . . . , 1), formed by n − 1 zeros and n − 1 ones, has length 2n − 2 and we cannot extract from it a… 
Highly Cited
1998
Highly Cited
1998
Factors of sums of powers of binomial coefficients
We prove divisibility properties for sums of powers of binomial coefficients and of q-binomial coefficients. Dedicated to the… 
1983
1983
Local connectivity of a random graph
A graph islocallyconnected if for each vertex v of degree --2,the subgraph induced by the vertices adjacent to v is connected… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)