Timeline for answer to Most intricate and most beautiful structures in mathematics by Andrew D. King
Current License: CC BY-SA 2.5
Post Revisions
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 15, 2010 at 3:27 | comment | added | Andrew D. King | Gil: For the reason that it can easily demonstrate the existence of a graph with a beautiful and intricate structure without explicitly exhibiting it. Although you could argue that we may as well say that a coin flip is is an intricate and beautiful structure. Also, it should maybe be disqualified by your "single object" specification. | |
| Dec 15, 2010 at 0:16 | comment | added | Yemon Choi | David: isn't that graph also known as "the" random graph on a countably infinite vertex set? | |
| Dec 14, 2010 at 23:57 | comment | added | David Roberts♦ | I would say the Erdős–Renyi/Rado graph en.wikipedia.org/wiki/Rado_graph rather than this, if you're looking for something from graph theory. This occurs as the Fraïssé limit of the category of finite graphs and embeddings golem.ph.utexas.edu/category/2009/11/fraisse_limits.html | |
| Dec 14, 2010 at 21:45 | comment | added | Gil Kalai | What philosophical reasons? | |
| Dec 14, 2010 at 20:29 | history | answered | Andrew D. King | CC BY-SA 2.5 |