# Difference between revisions of "403: Convincing Pickup Line"

Line 20: | Line 20: | ||

[[Category:Comics featuring Cueball]] | [[Category:Comics featuring Cueball]] | ||

[[Category:Comics featuring Megan]] | [[Category:Comics featuring Megan]] | ||

− | [[Category: | + | [[Category:Math]] |

+ | [[Category:Romance]] |

## Revision as of 11:40, 1 December 2012

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

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, why Megan suggests that they should sleep together.

### Title text

This is a small-world joke on the concept of 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 persons Erdős number is the "collaborative distance" between the person and Erdős. Paul Erdős Erdős number is 0 by definition. All his 511 collaborators have the Erdős number 1. If you have written a paper with someone who's written a paper with someone who's ritten a paper with Paul Erdős your Erdős number is 3. If you know a mathematician or are a matematician you can calculate your Erdős number here.

## Transcript

- [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)