# 403: Convincing Pickup Line

Convincing Pickup Line |

Title text: Check it out; I've had sex with someone who's had sex with someone who's written a paper with Paul Erdős! |

## Explanation[edit]

A graph is a mathematical object consisting of **nodes** connected by lines called **edges**. The nodes could represent for example people, and the edges could represent a connection from having slept together. Now, Megan has such a graph. Arguably, a graph that is symmetric is nicer than a regular one, which is why Megan suggests that they should sleep together.

The title text is a small-world joke on the concept of an Erdős number. Paul Erdős was a Hungarian mathematician renowned for his eccentricity and productivity. He holds the world record for the number of published math papers, as well as for the number of collaborative papers. A person's Erdős number is the "collaborative distance" between the person and Erdős. Paul Erdős's Erdős number is 0 by definition. All of his 511 collaborators have the Erdős number of 1; anyone further (excluding Erdős and such an individual) who has collaborated on a mathematical or scientific paper with any of those collaborators has an Erdős number of 2, and so on. Thus, if you have written a paper with someone who's written a paper with someone who's written a paper with Paul Erdős, your Erdős number is 3. If you know a mathematician or are a mathematician, you can calculate their or your Erdős number here.

This may also be a reference to Chapter 4 of Candide, wherein Pangloss tells the protagonist of the genealogy of his syphilis. He received the disease from Paquette, who acquired it from a Franciscan, as so on until the lineage starts with one of the adventurers of Christopher Columbus.

In 599: Apocalypse, Cueball actually manages to write a paper with zombie Erdős, thus having a Erdős number of 1.

## Transcript[edit]

- [Cueball and Megan sit at a small table in a cafe. Megan holds up a graph.]
- Megan: We're a terrible match. But if we sleep together, it'll make the local hookup network a symmetric graph.
- Cueball: I can't argue with that.

**add a comment!**⋅

**add a topic (use sparingly)!**⋅

**refresh comments!**

# Discussion

I'm more intrigued by the Erdős–Bacon number, where Natalie Portman and Carl Sagan both have a six (5+1 and 4+2 respectively). Hogtree Octovish (talk) 06:47, 16 February 2013 (UTC)

- Wikipedia and erdosbaconsabbath.com say that Natalie Portman's EB is 7, not six. (Bacon 2, not 1.) Still awesome. gijobarts (talk) 03:36, 2 March 2016 (UTC)
- Stephen Hawking has a lower Bacon number than Erdos number. (2 and 4) Netherin5 (talk) 17:39, 13 March 2019 (UTC)

There's some irony here that they both think that they are terrible matches with each other, but both like the logic of making the graph symmetrical, indicating that they probably would be a good match Zachweix (talk) 16:57, 5 November 2018 (UTC)

One could argue that graphs that represent "(consensually) sleeping with each other" are always symmetric, making this a rather tautological pick-up line. 23:06, 21 March 2023 (UTC)

- Not every undirected graph is symmetric. 141.101.76.6 (talk) 11:11, 4 January 2024
*(please sign your comments with ~~~~)*- Is it not? For every path (single- or multi-edge) from node A to node B, there will be an identical (reversed) one from B to A. It seems to me that this would introduce full symmetry regardless of configuration. 172.71.242.185 18:12, 4 January 2024 (UTC)