Second-largest connected component of mathematicians

Question

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?

Answer 1

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.