# 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…
Wikipedia (opens in a new tab)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
• Combinatorics, probability & computing
• 2014
• Corpus ID: 15477677
Let ${\cal A}$ be a minor-closed class of labelled graphs, and let ${\cal G}_{n}$ be a random graph sampled uniformly from the…
2014
2014
• Advances in Applied Mathematics
• 2014
• Corpus ID: 37684602
2014
2014
• Algorithmica
• 2014
• Corpus ID: 13133441
A commonly studied means of parameterizing graph problems is the deletion distance from triviality (Guo et al., Parameterized and…
2011
2011
• Discrete Applied Mathematics
• 2011
• Corpus ID: 9712372
Highly Cited
2010
Highly Cited
2010
• Martin Grohe
• 25th Annual IEEE Symposium on Logic in Computer…
• 2010
• Corpus ID: 7381562
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is…
2010
2010
• Journal of combinatorial theory. Series B (Print)
• 2010
• Corpus ID: 12672576
Review
2009
Review
2009
• 2009
• Corpus ID: 15116428
In this article we survey recent results on the asymptotic enumeration of planar graphs and, more generally, graphs embeddable in…
Highly Cited
2009
Highly Cited
2009
• European journal of combinatorics (Print)
• 2009
• Corpus ID: 2633083
Highly Cited
2008
Highly Cited
2008
• ACM-SIAM Symposium on Discrete Algorithms
• 2008
• Corpus ID: 5541224
By Robertson and Seymour's graph minor theorem, every minor ideal can be characterised by a finite family of excluded minors. (A…