Pages that link to "Item:Q5516086"
From MaRDI portal
The following pages link to Transversals and matroid partition (Q5516086):
Displayed 50 items.
- A fast algorithm to construct a representation for transversal matroids (Q263073) (← links)
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks (Q273172) (← links)
- Finitary and cofinitary gammoids (Q298942) (← links)
- Extensions and presentations of transversal matroids (Q491730) (← links)
- Greedy matching: guarantees and limitations (Q513303) (← links)
- Lattices related to extensions of presentations of transversal matroids (Q521371) (← links)
- Matroid base polytope decomposition (Q544143) (← links)
- A note on binary fundamental transversal matroids (Q583217) (← links)
- Matroids and linking systems (Q599061) (← links)
- Induced graph packing problems (Q604669) (← links)
- Paley graphs have Hamilton decompositions (Q658027) (← links)
- Two results on the rank partition of a matroid (Q658575) (← links)
- A Tutte polynomial inequality for lattice path matroids (Q679539) (← links)
- Poset matching---a distributive analog of independent matching (Q685701) (← links)
- On a packing problem for infinite graphs and independence spaces (Q754225) (← links)
- Structural theorems for submodular functions, polymatroids and polymatroid intersections (Q757383) (← links)
- A note on the separation problem for the matching matroid (Q760436) (← links)
- Defining matroids through sequential selection (Q854847) (← links)
- Infinite gammoids: minors and duality (Q907227) (← links)
- Probabilistic single processor scheduling (Q912611) (← links)
- Extending Hall's theorem into list colorings: a partial history (Q925374) (← links)
- Rooted \(k\)-connections in digraphs (Q1025990) (← links)
- The Edmonds-Gallai decomposition for matchings in locally finite graphs (Q1053712) (← links)
- An extension of matching theory (Q1057288) (← links)
- Fractional matchings and the Edmonds-Gallai theorem (Q1098861) (← links)
- On matroids induced by packing subgraphs (Q1109053) (← links)
- Tabloides (Q1140088) (← links)
- Network theory and transversal matroids (Q1147102) (← links)
- Another proof of a theorem concerning detachments of graphs (Q1176032) (← links)
- A short proof that matching matroids are transversal (Q1186958) (← links)
- Complementary bases of a matroid (Q1212466) (← links)
- On the free matrix representation of transversal geometries (Q1212940) (← links)
- Matchings in graphs. II (Q1214950) (← links)
- A maximum-rank minimum-term-rank theorem for matroids (Q1216310) (← links)
- Truncations of principal geometries (Q1216312) (← links)
- Kuratowski's and Wagner's theorems for matroids (Q1232413) (← links)
- Transversal theory and rank functions (Q1241444) (← links)
- A simple proof that every matroid is an intersection of fundamental transversal matroids (Q1242925) (← links)
- An extension of Tutte's 1-factor theorem (Q1256496) (← links)
- The optimal path-matching problem (Q1272178) (← links)
- Pfaffian structures and critical problems in finite symplectic spaces (Q1293433) (← links)
- Compatible systems of representatives (Q1336656) (← links)
- A note on list arboricity (Q1386426) (← links)
- Elementary strong maps and transversal geometries (Q1393251) (← links)
- Extension of partial diagonals of matrices. II (Q1393573) (← links)
- The Kadison-Singer problem in discrepancy theory. (Q1427482) (← links)
- Extensions of matroid covering and packing (Q1633609) (← links)
- The base-matroid and inverse combinatorial optimization problems. (Q1811117) (← links)
- Sufficient regularity conditions for common transversals (Q1843434) (← links)
- The \(r\)-depth of a matroid (Q1894761) (← links)