Skip to search formSkip to main contentSkip to account menu

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
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
2014
2014
A commonly studied means of parameterizing graph problems is the deletion distance from triviality (Guo et al., Parameterized and… 
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
Review
2009
Review
2009
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
Highly Cited
2008
Highly Cited
2008
By Robertson and Seymour's graph minor theorem, every minor ideal can be characterised by a finite family of excluded minors. (A…