Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
  • R. Hofstad
  • Cambridge Series in Statistical and Probabilistic…
  • 2016
  • Corpus ID: 30744144
In this chapter, we draw motivation from real-world networks, and formulate random graph models for them. We focus on some of the… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
Highly Cited
2015
Highly Cited
2015
In this paper, we prove that a set of N points in R 2 has at least c N log N distinct distances, thus obtaining the sharp… Expand
Is this relevant?
Highly Cited
2012
Highly Cited
2012
In this paper we study degree conditions which guarantee the existence of perfect matchings and perfect fractional matchings in… Expand
Is this relevant?
Highly Cited
2011
Highly Cited
2011
What does an Erdos-Renyi graph look like when a rare event happens? This paper answers this question when p is fixed and n tends… Expand
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We say that α ∈ [0, 1) is a jump for an integer r ≥ 2 if there exists c(α) > 0 such that for all ϵ > 0 and all t ≥ 1, any r-graph… Expand
  • figure 1
Is this relevant?
2006
2006
Let fr(n,v,e) denote the maximum number of edges in an r-uniform hypergraph on n vertices, which does not contain e edges spanned… Expand
  • figure 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Recently there has been much interest in studying large-scale real-world networks and attempting to model their properties using… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
  • L A S Z L, O A Szé K E
  • 1997
  • Corpus ID: 16310883
We show that an old but not well-known lower bound for the crossing number of a graph yields short proofs for a number of bounds… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
A bstract . The distribution νλ of the random series ∑ ±λn has been studied by many authors since the two seminal papers by Erdős… Expand
Is this relevant?
Highly Cited
1983
Highly Cited
1983
  • J. Beck
  • Comb.
  • 1983
  • Corpus ID: 31011939
LetS be a set ofn non-collinear points in the Euclidean plane. It will be shown here that for some point ofS the number… Expand
Is this relevant?