...t; 3) for every subset $A \subseteq V$, all the independent subsets of the matroid which are contained in $A$ and are maximal with respect to inclusion relati
...the set of all transversals of the graph $G$ form a so-called transversal matroid.
10 KB (1,753 words) - 20:24, 20 November 2023
Let $M$ be a [[Matroid|matroid]] with rank function $r$ on the ground set $E$. The Tutte polynomial $t ( M
...ions of $t ( M )$; the most useful such expression is recursive, using the matroid operations of deletion and contraction:
11 KB (1,736 words) - 06:27, 15 February 2024
is called the dual of the hypergraph $ H $
...ant special case of the concept of a "hypergraph" is that of a [[Matroid|matroid]]. Many concepts in the theory of graphs, such as connectedness, planarity,
4 KB (690 words) - 22:11, 5 June 2020
...portant class of semi-modular lattices is that of the "nearly geometric" matroid lattices (see [[#References|[2]]]). Every finite lattice is isomorphic to a
...ices, one also considers lower semi-modular lattices, which are defined in dual fashion. Examples of semi-modular lattices, apart from modular lattices, ar
2 KB (385 words) - 12:06, 23 November 2023