tag:blogger.com,1999:blog-6555947.post111205345032314348..comments2014-01-12T10:46:48.153-07:00Comments on The Geomblog: Open ProblemsSuresh Venkatasubramanianhttps://plus.google.com/112165457714968997350noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-6555947.post-1112128614689971302005-03-29T13:36:00.000-07:002005-03-29T13:36:00.000-07:00I don't know if this is a good open problem. I mi...I don't know if this is a good open problem. I might not be good. It might not be open. But it has vexed me. <BR/><BR/>Ever since I've read about the Kobe embedding theorem, I always wondered what 3-d "coin graphs" would look like. By coin, I mean a flat 2-d disk living in R^3. Two disks are adjacent if their boundaries share a common point. Two disks cannot meet anywhere but on their boundaries. Given a graph G, can you find a realization of G using coins in R^3? If not, which ones are possible? <BR/><BR/><BR/>I know this statement isn't rigorous but I hope you get the idea. <BR/><BR/><BR/>  <BR/><BR/><A></A><A></A>Posted by<A><B> </B></A>AnonymousAnonymousnoreply@blogger.com