Amalgamation over uniform matroids
Svatopluk Poljak, Daniel Turzík (1984)
Czechoslovak Mathematical Journal
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Svatopluk Poljak, Daniel Turzík (1984)
Czechoslovak Mathematical Journal
Similarity:
Jaritz, Renate (1997)
Beiträge zur Algebra und Geometrie
Similarity:
Eunice Gogo Mphako (2006)
Czechoslovak Mathematical Journal
Similarity:
We give an example of a class of binary matroids with a cocircuit partition and we give some characteristics of a set of cocircuits of such binary matroids which forms a partition of the ground set.
Kiran Dalvi, Y.M. Borse, M.M. Shikare (2011)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper, we prove that an element splitting operation by every pair of elements on a cographic matroid yields a cographic matroid if and only if it has no minor isomorphic to M(K₄).
Wojciech Kordecki, Anna Łyczkowska-Hanćkowiak (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Dohmen [4] gives a simple inductive proof of Whitney’s famous broken circuits theorem. We generalise his inductive proof to the case of matroids
Mayhew, Dillon (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bouchet, André (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Wagner, David G. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity: