Matroid minor

In the mathematical theory of matroids, a minor of a matroid M is another matroid N that is obtained from M by a sequence of restriction and…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

In this paper, we give a cancellation-free antipode formula for the matroid-minor Hopf algebra. We then explore applications of…

2017

2017

Bounded expansion and nowhere dense graph classes, introduced by Nesetril and Ossona de Mendez, form a large variety of classes…

2016

Every gammoid is a minor of an excluded minor for the

2015

We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an…

2014

The Erdős‐Pósa theorem (1965) states that in each graph G which contains at most k disjoint cycles, there is a ‘blocking’ set B…

2013

Tree-width and path-width are two important graph parameters introduced by Robertson and Seymour in their famous Graph Minors…

2011

We provide a characterization of graphs of linear rankwidth at most 1 by minimal excluded vertex-minors.

2001

The number of excluded minors for the class of graphs with path-width at most two is very large. To give a practical…

1989

A collection of (simple) cycles in a graph is called fundamental if they form a basis for the cycle space and if they can be…