The following pages link to (Q4111952):
Displaying 50 items.
- The 2-quasi-greedy algorithm for cardinality constrained matroid bases (Q1079134) (← links)
- Two results about points, lines and planes (Q1079194) (← links)
- Minors of 3-connected matroids (Q1079571) (← links)
- A nonlinear algebraic matroid with infinite characteristic set (Q1080857) (← links)
- Exchange properties of combinatorial closure spaces (Q1083458) (← links)
- A Mazur-Orlicz type theorem for submodular set functions (Q1084205) (← links)
- A class of graphs containing the polar spaces (Q1084420) (← links)
- Semi-duality and the cycle double cover conjecture (Q1085163) (← links)
- A decomposition theory for matroids. III. Decomposition conditions (Q1086242) (← links)
- Triples in matroid circuits (Q1086243) (← links)
- On chains of 3-connected matroids (Q1086571) (← links)
- Some combinatorial properties of discriminants in metric vector spaces (Q1086575) (← links)
- Nowhere-zero integral chains and flows in bidirected graphs (Q1088883) (← links)
- Independence spaces and uniform modules (Q1088993) (← links)
- Independence structures on the submodules of a module (Q1088994) (← links)
- Matroid Steiner problems, the Tutte polynomial and network reliability (Q1088995) (← links)
- Decomposition and optimization over cycles in binary matroids (Q1089347) (← links)
- On-line updating of solutions to a class of matroid intersection problems (Q1090461) (← links)
- Combinatorial geometries, convex polyhedra, and Schubert cells (Q1090983) (← links)
- On ternary transversal matroids (Q1092053) (← links)
- Polarity and point extensions in oriented matroids (Q1092911) (← links)
- Dowling group geometries and the critical problem (Q1092912) (← links)
- On the independence numbers of a matroid (Q1093645) (← links)
- An extension of Lindström's result about characteristic sets of matroids (Q1093646) (← links)
- Adjacency in binary matroids (Q1093647) (← links)
- Extension equivalence of oriented matroids (Q1093648) (← links)
- Note sur la notion d'équivalence entre deux codes linéaires (Q1095866) (← links)
- Clutters and semimatroids (Q1095913) (← links)
- Clutters and atomistic lattices (Q1095914) (← links)
- Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid (Q1097893) (← links)
- Matroid erection and duality (Q1098856) (← links)
- Isotropic systems (Q1101116) (← links)
- A lower bound on connectivities of matroid base graphs (Q1101135) (← links)
- Quotients of Dilworth truncations (Q1101458) (← links)
- A construction for binary matroids (Q1102297) (← links)
- A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids (Q1102299) (← links)
- The long-line graph of a combinatorial geometry. II: Geometries representable over two fields of different characteristics (Q1102973) (← links)
- An infinite family of minor-minimal nonrealizable 3-chirotopes (Q1102974) (← links)
- Recognizing max-flow min-cut path matrices (Q1103514) (← links)
- A characterization of undirected branching greedoids (Q1103626) (← links)
- Symmetry and positive definiteness in oriented matroids (Q1105613) (← links)
- Alternating Whitney sums and matchings in trees. 1 (Q1105614) (← links)
- The complexity of parallel search (Q1106664) (← links)
- On harmonic conjugates in full algebraic combinatorial geometries (Q1106850) (← links)
- On binary paving matroids (Q1108281) (← links)
- On binary reducibility (Q1109039) (← links)
- Adjoints of binary matroids (Q1109040) (← links)
- On matroids induced by packing subgraphs (Q1109053) (← links)
- Pseudomatroids (Q1109779) (← links)
- Chordal characterization of graphic matroids (Q1109781) (← links)
