Editing 403: Convincing Pickup Line
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 10: | Line 10: | ||
A {{w|graph (mathematics)|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 {{w|symmetric graph|graph that is symmetric}} is nicer than a regular one, which is why Megan suggests that they should sleep together. | A {{w|graph (mathematics)|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 {{w|symmetric graph|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 | + | The title text is a small-world joke on the concept of {{w|Erdős number}}. {{w|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 1; anyone 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 his/her/your Erdős number [http://www.ams.org/mathscinet/collaborationDistance.html here]. |
− | + | The Collaboration Graph is the graph where each edge represents two people collaborated on a mathematical paper together, and the people represented are those with an Erdős number. Some of Erdős's colleagues have published papers about the properties of the Collaboration Graph, treating it as if it were a real mathematical object. One of these papers made the observation that the graph would have a certain very interesting property if two particular points had an edge between them. To make the Collaboration Graph have that property, the two disconnected mathematicians immediately got together, proved something trivial, and wrote up a joint paper. Explained [http://www.nytimes.com/books/first/h/hoffman-man.html here]. | |
− | + | Comic [[599: Apocalypse]] also references Erdős numbers. | |
==Transcript== | ==Transcript== |