home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #18 / NN_1992_18.iso / spool / comp / theory / 1747 < prev    next >
Encoding:
Text File  |  1992-08-12  |  742 b   |  22 lines
  1. Newsgroups: comp.theory
  2. Path: sparky!uunet!zaphod.mps.ohio-state.edu!usc!snorkelwacker.mit.edu!bloom-picayune.mit.edu!chasman
  3. From: chasman@athena.mit.edu (David Chasman)
  4. Subject: TRIVIAL QUESTION FROM AN IGNORANT CHEMIST
  5. Message-ID: <1992Aug12.223838.19190@athena.mit.edu>
  6. Keywords: graph,embedding
  7. Sender: news@athena.mit.edu (News system)
  8. Nntp-Posting-Host: m4-035-13.mit.edu
  9. Organization: Massachusetts Institute of Technology
  10. Date: Wed, 12 Aug 1992 22:38:38 GMT
  11. Lines: 9
  12.  
  13. I have the following problem.  I have a bunch of verticies and I know
  14. which edges of the completely connected graph exist.  For a graph of
  15. this sort, is there a simple way to compute the minimum embedding
  16. dimension?  e-mail replies appreciated.
  17.  
  18. --David Chasman
  19.  
  20.  
  21.  
  22.