FOM: Seymour-Robertson

Thomas Forster T.Forster at
Thu Jan 8 12:06:59 EST 1998

    Do people here think that the Seymour-Robertson theorem 
 shortens the odds on P = NP?  Also (Altho' i am aware that this
 is probably not the place to raise this question nobody in
 this town admits to knowing what a BQO is!) do Seymour and
  Robertson claim to have shown that the graph minor relation
 on finite graphs is a WQO, or a BQO?

        Thomas Forster

More information about the FOM mailing list