Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,162,470 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
33 relations
Algebraic matroid
Bicircular matroid
Binary matroid
Branch-decomposition
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Matroid-minor Hopf algebra: a cancellation-free antipode formula and other applications of sign-reversing involutions
E. Bucher
,
Christopher Eppolito
,
Jaiung Jun
,
Jacob P. Matherne
2018
Corpus ID: 119562391
In this paper, we give a cancellation-free antipode formula for the matroid-minor Hopf algebra. We then explore applications of…
Expand
2016
2016
The antichain of excluded minors for the class of gammoids is maximal
Dillon Mayhew
2016
Corpus ID: 10222955
Every gammoid is a minor of an excluded minor for the
2015
2015
FORK-DECOMPOSITIONS OF ?
Rhiannon Hall
,
J. Oxley
,
C. Semple
,
G. Whittle
2015
Corpus ID: 38197807
One of the central problems in matroid theory is Rota's conjecture that, for all prime powers q, the class of GF(q)-representable…
Expand
2013
2013
On 3-Connected Graphs of Path-Width at Most Three
Guoli Ding
,
Stan Dziobiak
SIAM Journal on Discrete Mathematics
2013
Corpus ID: 1037809
Tree-width and path-width are two important graph parameters introduced by Robertson and Seymour in their famous Graph Minors…
Expand
2013
2013
Binary Matroids with no 4-Spike Minors Sean McGuinness
Thompson Rivers
2013
Corpus ID: 17514616
For a simple binary matroid M having no n-spike minor, we examine the problem of bounding |E(M)| as a function of its rank r(M…
Expand
2012
2012
The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles
Neeldhara Misra
,
Geevarghese Philip
,
Venkatesh Raman
,
Saket Saurabh
Algorithmica
2012
Corpus ID: 253984148
In the Parameterized Connected Dominating Set problem the input consists of a graph G and a positive integer k, and the question…
Expand
2012
2012
Binary Matroids with Graphic Cocircuits
K. Papalamprou
,
L. Pitsoulis
2012
Corpus ID: 119731881
An excluded minor characterization for the class of binary signed-graphic matroids with graphic cocircuits is provided. In this…
Expand
2008
2008
The search for an excluded minor characterization of ternary Rayleigh matroids
Stephanie Phillips
2008
Corpus ID: 118109606
Rayleigh matroids are a class of matroids with sets of bases that satisfy a strong negative correlation property. Interesting…
Expand
2007
2007
Partial tracks , characterizations and recognition of graphs with pathwidth at most two
J. Barát
,
P. Hajnal
2007
Corpus ID: 15359671
Nancy G. Kinnersley and Michael A. Langston has determined [3] the excluded minors for the class of graphs with path-width at…
Expand