Negative Results for Learing Minor Closed Graph Classes

The paper considers the problem of learning classes of graphs closed under taking minors. It was shown that any such class can be properly learned in polynomial time using membership and equivalence queries. The representation of the class is in terms of a set of minimal excluded minors (obstruction set). A negative result for learning such classes using only equivalence queries is provided, after introducing a notion of reducibility between query learning problems.