The real problem, of course, is to prove Seymour's Conjectre for countable graphs (which suffices for the Graph Minor Theorem). Note that Oporowski's example involves uncountable many vertices.
login/create account
Drupal
CSI of Charles University
Real Problem
The real problem, of course, is to prove Seymour's Conjectre for countable graphs (which suffices for the Graph Minor Theorem). Note that Oporowski's example involves uncountable many vertices.