Let $\Gamma$ be the graph defined as follows:

  • the vertices are mathematicians who have published papers
  • there is an edge between any two mathematicians who have authored publications together.

Graph $\Gamma$ is certainly not connected, as there are mathematicians who have only published papers without collaborators. Obviously, the largest connected component is the one containing Paul Erdős, since almost all mathematicians today belong to this component. My question is:

Does anyone have an idea what the second-largest connected component is?

  • $\begingroup$ Is this matter of interest ? $\endgroup$ – Jean Marie Jun 10 '17 at 11:26
  • 13
    $\begingroup$ I am curious, so yes. Isn’t that how most questions arise? $\endgroup$ – Gaussler Jun 10 '17 at 11:32
  • 2
    $\begingroup$ @AnthonyHernandez no, he is simply well-known for having many collaborators, as reflected in the use Erdős numbers. The fact that most mathematicians have an Erdős number less than infinity proves that almost all of mathematical society is connected. $\endgroup$ – Gaussler Jun 10 '17 at 13:46
  • 5
    $\begingroup$ @AnthonyHernandez it actually is true according to the data on the page linked to. It's somewhat tangential to this discussion though; the stress in the question is misplaced. I'd venture to bet that removing Erdős (or anyone for that matter) would not change the graph substantially. It would always have one "giant" component. $\endgroup$ – quid Jun 10 '17 at 15:20
  • 1
    $\begingroup$ Probably the answer depends on how you define "mathematicians". I guess that the second component is in a very applied area or one far away from mainstream mathematics. $\endgroup$ – Federico Poloni Jun 10 '17 at 15:38

At https://oakland.edu/enp/trivia/ you can read that

there is one large component consisting of about 268,000 vertices. Of the remaining 133,000 authors, 84,000 of them have written no joint papers (these are isolated vertices in C).

... the average number of collaborators for people who have collaborated but are not in the large component is 1.65.

If the second largest component had two vertices that number would be just $1$.

Commenters below have found the size of that component (at various historical moments.)

You can download the data from that site and write a program to find out who is in that component.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.