No subject

[N. J. A. Sloane]

 From bdm at cs.anu.edu.au  Sat Dec 18 19:12:16 1999
Return-Path: <bdm at cs.anu.edu.au>
Delivered-To: njas at research.att.com
Date: Sun, 19 Dec 1999 11:12:03 +1100 (EST)
From: Brendan McKay <bdm at cs.anu.edu.au>
Message-Id: <199912190012.LAA20352 at antares.anu.edu.au>
To: eww at wolfram.com
Subject: Re: graph query
Cc: njas at research.att.com
Status: R

Hi Eric.

The problem is that you have a non-planar graph:

 Graph[{{0, 0, 0, 1, 1, 1}, {0, 0, 0, 1, 1, 1}, {0, 0, 0, 1, 1, 1}, 
   {1, 1, 1, 0, 1, 1}, {1, 1, 1, 1, 0, 1}, {1, 1, 1, 1, 1, 0}}, 
  {{1., 0.}, {0.5, 0.8660254037844386}, {-0.5, 0.8660254037844386}, 
   {-1., 0.}, {-0.5, -0.8660254037844386}, {0.5, -0.8660254037844386}}], 

You can see that the first three vertices are adjacent to the
last three, so there is a K(3,3,) in there.
 
Now I also have confirmation of my numbers for n <= 9 from
Wendy Myrvold.

Please announce it to the mailing list.

Cheers,
Brendan.