Saturday, December 27, 2008

A Post Few of My Readers Are Likely to Understand

A graph G is strongly asteroidal if it contains three vertices a, b, c such that there is a path between any two of these vertices that

  1. Does not contain the third vertex, nor any neighbor of the third vertex.
  2. Does not contain two consecutive vertices that are adjacent to every neighbor of the third vertex.

This? Is my job.


Anonymous said...

...please where can I buy a unicorn?

J. Bowman said...

I don't know what this means.