We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
Knowing the excluded minors for a minor-closed matroid property provides a useful alternative characterization of that property. It has been shown in [R. Hall, J. Oxley, C. Semple...
A lattice path matroid is a transversal matroid for which some antichain of intervals in some linear order on the ground set is a presentation. We characterize the minor-closed cla...
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...