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.

Reply

Comments are limited to a maximum of 1000 characters.
More information about formatting options