scientific article; zbMATH DE number 3534506
From MaRDI portal
Publication:4111952
Cited in
(only showing first 100 items - show all)- A generalization of Kneser's addition theorem
- Minimum partition of an independence system into independent sets
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- Frame cellular automata: Configurations, generating sets and related matroids
- Matroid algorithm for monitorability analysis of bond graphs
- (L,M)-fuzzy matroids
- A quasisymmetric function for matroids
- Ehrhart polynomials of matroid polytopes and polymatroids
- Maximal Sidon sets and matroids
- Bivalent trees and forests or upper bounds for the probability of a union revisited
- Balanced sets in an independence structure induced by a submodular function
- On a characterization of Dilworth truncations of combinatorial geometries
- Unions of oriented matroids
- Arbres minimaux d'un graphe preordonne
- Nowhere-zero integral flows on a bidirected graph
- A class of matroids derived from saturated chain partitions of partially ordered sets
- On matroids of the greatest W-connectivity
- Rigidity of multi-graphs. I: Linking rigid bodies in n-space
- Testing membership in matroid polyhedra
- On the complexity of recognizing a class of generalized networks
- Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
- Polarity and inner products in oriented matroids
- Boolean techniques for matroidal decomposition of independence systems and applications to graphs
- Modularity in tangential k-blocks
- An Erdős-Gallai conjecture
- Circuit preserving edge maps. II
- Nowhere zero flow and circuit covering in regular matroids
- Connectivity in bicircular matroids
- On theories of Whitney and Tutte
- A characterization of the ternary matroids with no \(M(K_ 4)\)-minor
- First-order theories of abstract dependence relations
- Algebraic characteristic sets of matroids
- Directed switching games on graphs and matroids
- On determination of graph G whose bond lattice \({\mathcal L}(G)\) is modular
- Matroidal games
- Upper bounds for the cardinality of s-distances codes
- On Tutte polynomials and cycles of plane graphs
- On the decomposition of vector spaces
- On the cycle polytope of a binary matroid
- The 2-quasi-greedy algorithm for cardinality constrained matroid bases
- Two results about points, lines and planes
- Minors of 3-connected matroids
- A nonlinear algebraic matroid with infinite characteristic set
- Exchange properties of combinatorial closure spaces
- A Mazur-Orlicz type theorem for submodular set functions
- A class of graphs containing the polar spaces
- Semi-duality and the cycle double cover conjecture
- A decomposition theory for matroids. III. Decomposition conditions
- Triples in matroid circuits
- On chains of 3-connected matroids
- Some combinatorial properties of discriminants in metric vector spaces
- Nowhere-zero integral chains and flows in bidirected graphs
- Independence spaces and uniform modules
- Independence structures on the submodules of a module
- Matroid Steiner problems, the Tutte polynomial and network reliability
- Decomposition and optimization over cycles in binary matroids
- On-line updating of solutions to a class of matroid intersection problems
- Combinatorial geometries, convex polyhedra, and Schubert cells
- On ternary transversal matroids
- Polarity and point extensions in oriented matroids
- Dowling group geometries and the critical problem
- On the independence numbers of a matroid
- An extension of Lindström's result about characteristic sets of matroids
- Adjacency in binary matroids
- Extension equivalence of oriented matroids
- Note sur la notion d'équivalence entre deux codes linéaires
- Clutters and semimatroids
- Clutters and atomistic lattices
- Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid
- Matroid erection and duality
- Isotropic systems
- A lower bound on connectivities of matroid base graphs
- Quotients of Dilworth truncations
- A construction for binary matroids
- A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
- The long-line graph of a combinatorial geometry. II: Geometries representable over two fields of different characteristics
- An infinite family of minor-minimal nonrealizable 3-chirotopes
- Recognizing max-flow min-cut path matrices
- A characterization of undirected branching greedoids
- Symmetry and positive definiteness in oriented matroids
- Alternating Whitney sums and matchings in trees. 1
- The complexity of parallel search
- On harmonic conjugates in full algebraic combinatorial geometries
- On binary paving matroids
- On binary reducibility
- Adjoints of binary matroids
- On matroids induced by packing subgraphs
- Pseudomatroids
- Chordal characterization of graphic matroids
- Duality theory for finite and infinite matroids with coefficients
- On attainable distribution and classification vectors
- A solution of the misère Shannon switching game
- The incidence structure of subspaces with well-scaled frames
- Ordering of the elements of a matroid such that its consecutive w elements are independent
- A characterization of a class of non-binary matroids
- A circuit set characterization of antimatroids
- On matroids which have precisely one basis in common
- Basis pair graphs of transversal matroids are connected
- A short proof of a theorem of Vámos on matroid representations
- The biased graphs whose matroids are binary
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4111952)
