Lattice Theory of Generalized Partitions
From MaRDI portal
Cited in
(13)- Finite Four-Generated Simple Lattices Contain All Finite Lattices
- Exchange Distance of Basis Pairs in Split Matroids
- Hypergraph characterization of split matroids
- A Decomposition for Combinatorial Geometries
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- A method of finding automorphism groups of endomorphism monoids of relational systems.
- The number of partial Steiner systems and d-partitions
- Approximating submodular matroid-constrained partitioning
- A method to construct all the paving matroids over a finite set
- Uniformität des Verbandes der Partitionen
- Paving matroids: defining equations and associated varieties
- List coloring of two matroids through reduction to partition matroids
- Complexity of packing common bases in matroids
This page was built for publication: Lattice Theory of Generalized Partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3264606)