Lectures on matroids
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Infinite coverings of cages
- Circuit preserving edge maps. II
- Cycle covering in bridgeless graphs
- A finite crisscross method for oriented matroids
- On the decomposition of vector spaces
- Nowhere-zero integral chains and flows in bidirected graphs
- An extension of Lindström's result about characteristic sets of matroids
- A construction for binary matroids
- Unimodularity and circle graphs
- Adjoints of binary matroids
- Duality theory for finite and infinite matroids with coefficients
- The incidence structure of subspaces with well-scaled frames
- Reducing prime graphs and recognizing circle graphs
- The biased graphs whose matroids are binary
- Characterizations of finitary and cofinitary binary matroids
- Turán's triangle theorem and binary matroids
- The Tutte group of a weakly orientable matroid
- On the fundamental group of 3-gems and a `planar' class of 3-manifolds
- Polyhedra of regular p-nary group problems
- Subspaces with well-scaled frames
- A short proof of Tutte's characterization of totally unimodular matrices
- A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids
- On the matroids in which all hyperplanes are binary
- Flows and generalized coloring theorems in graphs
- Matroid representation over GF(3)
- Independence systems with continuous cardinality of bases
- Non-separating induced cycles in graphs
- Representation over a field of full simplicial matroids
- Nonexistence of seven-dimensional tangential 2-blocks
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- On the sum of matroids. III
- Separating cocircuits in binary matroids
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- k-elimination property for circuits of matroids
- Projective equivalence of matroids with coefficients
- Triangles in 3-connected matroids
- Delta matroids whose fundamental graphs are bipartite
- Perfect matroids
- Valuated matroids
- Cycle lengths and circuit matroids of graphs
- Extensions of Tutte's wheels-and-whirls theorem
- A decomposition theory for matroids. VII: Analysis of minimal violation matrices
- A combinatorial generalization of polytopes
- Truncations of principal geometries
- A composition for matroids
- The principal minors of a matroid
- Two algorithms for matroids
- The Euler circuit theorem for binary matroids
- On tangential 2-blocks
- Nonexistence of six-dimensional tangential 2-block
- A strengthened form of Tutte's characterization of regular matroids
- Characterizing binary simplicial matroids
- Kuratowski's and Wagner's theorems for matroids
- Chords and disjoint paths in matroids
- Orientability of matroids
- A combinatorial abstraction of linear programming
- The matroids with the max-flow min-cut property
- Matroid Designs of Prime Power Index
- Characterizations of regular magic graphs
- On cographic regular matroids
- On Reid's characterization of the ternary matroids
- On Hartfiel and Maxson's definition of connected sets of a matroid
- Geometries simpliciales unimodulaires
- Matroids on partially ordered sets
- A unified treatment of the geometric algebra of matroids and even \(\Delta\)-matroids
- Bipartite graphs that are not circle graphs
- Multimatroids. IV: Chain-group representations
- Matroids having the same connectivity function
- Dependence systems with the operator-image exchange property
- Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs
- A generalization of Tutte's characterization of totally unimodular matrices
- \(l\)-matrices and a characterization of binary matroids
- Extremal critically connected matroids
- Matroids with many common bases.
- Biased graphs IV: Geometrical realizations
- The Tutte polynomial of a morphism of matroids. III: Vectorial matroids
- On the representation of configurations in projective spaces
- Peripheral circuits in infinite binary matroids
- Bipartite and Eulerian minors
- A note on immersion minors and planarity
- Matrices over finite fields and their Kirchhoff graphs
- Polynomials with the half-plane property and the support theorems
- Criteria for the global consistency of two-threshold preference relations in terms of forbidden subconfigurations
- Biased graphs whose matroids are special binary matroids
- On an excluded-minor class of matroids
- Algebraic relations between matroids connected by weak homomorphisms
- Counterexamples to conjectures on 4-connected matroids
- Geometric algebra for combinatorial geometries
- On the efficiency of representability tests for matroids
- The directions determined by n points in the plane: A matroidal generalization
- Properties of matroids characterizable in terms of excluded matroids
- Generalized \(\Delta\text{--}Y\) exchange and \(k\)-regular matroids
- Polynomials associated with nowhere-zero flows
- Maurer's homotopy theory for even \(\Delta\)-matroids and related combinatorial geometries
- Totally unimodular Leontief directed hypergraphs
- Orientations of chain groups
- Circuit separation for symmetric matroids
- Pfaffian forms and \(\Delta\)-matroids with coefficients
- General geometric lattices and projective geometry of modules
- The connectivity and diameter of second order circuit graphs of matroids
This page was built for publication: Lectures on matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5530480)
