The following pages link to Matroids and linking systems (Q599061):
Displaying 21 items.
- Reliable assignments of processors to tasks and factoring on matroids (Q685664) (← links)
- Legendre duality in combinatorial study of matrix pencils (Q691986) (← links)
- A flow model based on polylinking system (Q715085) (← links)
- The graph bottleneck identity (Q719327) (← links)
- Note on binary simplicial matroids (Q788731) (← links)
- Bimatroids and Gauss decomposition (Q875056) (← links)
- Induction of M-convex functions by linking systems (Q997074) (← links)
- Pseudomatroids (Q1109779) (← links)
- Combinatorial dynamical system theory: General framework and controllability criteria (Q1123170) (← links)
- König's theorem and bimatroids (Q1344070) (← links)
- Shapley's conjecture on the cores of abstract market games (Q1651297) (← links)
- Eigensets and power products of a bimatroid (Q1813669) (← links)
- The Tutte polynomial of a ported matroid (Q1820164) (← links)
- Some recent results in combinatorial approaches to dynamical systems (Q1823209) (← links)
- Combinatorial analysis. (Matrix problems, choice theory) (Q1837183) (← links)
- The excluded minors for GF(4)-representable matroids (Q1850480) (← links)
- Finding optimal minors of valuated bimatroids (Q1895110) (← links)
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems (Q2496319) (← links)
- A Tutte decomposition for matrices and bimatroids (Q2581499) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- A Matroid Abstraction of the Bott–Duffin Constrained Inverse (Q3039366) (← links)
