G-1SJL8 Erdos
Last updated: 1 Mar 2017
Included in collections
- Collection Networks
Files
Properties
- Order6927
- Size11850
- Minimum degree1
- Maximum degree507
- Diameter4
- Clique number5
- Connectedtrue
- Arcs0.0
- File size681
- Average degree3.4214
- Strong components1
- Weak components1
- Modes1
- Temporalfalse
- Multirelationalfalse
- Directedundirected
- Realtrue
- Genealogyfalse
- Multiple linesfalse
- Weightedfalse
- Minimum weight1.0
- Maximum weight1.0
- Loopsfalse
This network represents a part of the Erdős Collaboration network, derived from the data collected in the Erdős Number Project. Patrick Ion (Mathematical Reviews) and Jerry Grossman (Oakland University) maintain a collection of data on Paul Erdős, his co-authors and their co-authors.
Background:
The Erdős number describes the "collaborative distance" between mathematician Paul Erdős and another person, as measured by authorship of mathematical papers. 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 has an Erdős number of zero. Anybody else's Erdős number is k + 1 where k is the lowest Erdős number of any coauthor. A collection of all mathematicians listed in the Mathematical Reviews Catalogue of the American Mathematical Society is used to design such a network. These network was designed based on the aforementioned data, gathered in the year 2002.
Network image:
