Amalgamation over uniform matroids
Svatopluk Poljak, Daniel Turzík (1984)
Czechoslovak Mathematical Journal
Similarity:
Svatopluk Poljak, Daniel Turzík (1984)
Czechoslovak Mathematical Journal
Similarity:
Hliněný, Petr (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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
Cerdeira, J.Orestes, Barcia, Paulo (1995)
Portugaliae Mathematica
Similarity:
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₄).
Mani, Arun P. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Michel Las Vergnas (1999)
Annales de l'institut Fourier
Similarity:
We study the basic algebraic properties of a 3-variable Tutte polynomial the author has associated with a morphism of matroids, more precisely with a matroid strong map, or matroid perspective in the present paper, or, equivalently by the Factorization Theorem, with a matroid together with a distinguished subset of elements. Most algebraic properties of the usual 2-variable Tutte polynomial of a matroid generalize to the 3-variable polynomial. Among specific properties we show that the...