Infinite Matroids
From MaRDI portal
Cites work
- A Characterization of Union of Linearly Independent Sets
- A Combinatorial Theorem on Vector Spaces
- A Note on Independence Functions and Rank
- A Solution of the Shannon Switching Game
- Axiomatic Treatment of Rank in Infinite Sets
- scientific article; zbMATH DE number 3133252 (Why is no real title available?)
- scientific article; zbMATH DE number 3133601 (Why is no real title available?)
- scientific article; zbMATH DE number 3201718 (Why is no real title available?)
- Lectures on matroids
- Matroids and Graphs
- Minimum partition of a matroid into independent subsets
- Note on Independence Functions
- On non-denumerable graphs
- On the Abstract Properties of Linear Dependence
- On the Foundations of Combinatorial Theory II. Combinatorial Geometries
- Properties of finite character of independence spaces
- Ramsey's theorem for a class of categories
- Some Interpretations of Abstract Linear Dependence in Terms of Projective Geometry
- The elementary theory of finite fields
- The Representation Problem for Independence Functions
- Transversals and matroid partition
Cited in
(3)
This page was built for publication: Infinite Matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5676229)