Editing Talk:403: Convincing Pickup Line

Jump to: navigation, search
Ambox notice.png Please sign your posts with ~~~~

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 1: Line 1:
 
I'm more intrigued by the {{w|Erdős–Bacon number}}, where {{w|Natalie Portman}} and {{w|Carl Sagan}} both have a six (5+1 and 4+2 respectively). [[User:Hogtree Octovish|Hogtree Octovish]] ([[User talk:Hogtree Octovish|talk]]) 06:47, 16 February 2013 (UTC)
 
I'm more intrigued by the {{w|Erdős–Bacon number}}, where {{w|Natalie Portman}} and {{w|Carl Sagan}} both have a six (5+1 and 4+2 respectively). [[User:Hogtree Octovish|Hogtree Octovish]] ([[User talk: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. [[User:gijobarts|gijobarts]] ([[User Talk:gijobarts|talk]]) 03:36, 2 March 2016 (UTC)
 
:Wikipedia and erdosbaconsabbath.com say that Natalie Portman's EB is 7, not six. (Bacon 2, not 1.) Still awesome. [[User:gijobarts|gijobarts]] ([[User Talk:gijobarts|talk]]) 03:36, 2 March 2016 (UTC)
:Stephen Hawking has a lower Bacon number than Erdos number. (2 and 4) [[User:Netherin5|Netherin5]] ([[User talk: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 [[User:Zachweix|Zachweix]] ([[User talk: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. {{unsigned ip|141.101.76.6|11:11, 4 January 2024}}
 
::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. [[Special:Contributions/172.71.242.185|172.71.242.185]] 18:12, 4 January 2024 (UTC)
 

Please note that all contributions to explain xkcd may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see explain xkcd:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel | Editing help (opens in new window)

Templates used on this page: