Timeline for Touching-tetrahedra graphs
Current License: CC BY-SA 3.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 20, 2017 at 12:00 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Image link broken; now fixed.
|
Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
May 25, 2012 at 21:08 | comment | added | Douglas Zare | @Yoav Infinitely many convex solids can touch face-to-face, and this is realized by Voronoi diagrams from sequences of points on curves like the moment curve. See Erickson, J. Kim, S. "Arbitrarily large neighborly families of congruent symmetric 3-polytopes." for many references. | |
May 25, 2012 at 18:43 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
added 333 characters in body
|
May 25, 2012 at 18:37 | comment | added | Joseph O'Rourke | @Yoav: Good question! I don't know. | |
May 25, 2012 at 18:24 | comment | added | Yoav Kallus | Is this significantly different than asking for the family of graphs that are contact graphs of arbitrary convex solids? | |
May 25, 2012 at 18:05 | answer | added | Aaron Meyerowitz | timeline score: 2 | |
May 25, 2012 at 16:26 | answer | added | Igor Rivin | timeline score: 3 | |
May 25, 2012 at 14:01 | comment | added | Misha | Just a remark: The barycentric subdivision of every finite graph is realized this way (probably also true for locally finite graphs). Here I consider only graphs which are simplicial complexes. | |
May 25, 2012 at 11:51 | history | asked | Joseph O'Rourke | CC BY-SA 3.0 |