Pages that link to "Item:Q5845425"
From MaRDI portal
The following pages link to A THEOREM ON INDEPENDENCE RELATIONS (Q5845425):
Displaying 50 items.
- Packing Steiner trees (Q273179) (← links)
- Reconstructing binary matrices with timetabling constraints (Q350725) (← links)
- Spanning trees with specified differences in Cayley graphs (Q442368) (← links)
- Greedy algorithms and poset matroids (Q473210) (← links)
- Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs (Q484552) (← links)
- Matroids and linking systems (Q599061) (← links)
- Matching subspaces in a field extension. (Q627974) (← links)
- Some identification problems in the cointegrated vector autoregressive model (Q736675) (← links)
- Multicolored parallelisms of Hamiltonian cycles (Q1044961) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- An application of submodular flows (Q1119596) (← links)
- Multicolored forests in bipartite decompositions of graphs (Q1186126) (← links)
- The notion and basic properties of \(M\)-transversals (Q1196992) (← links)
- Independent transversals for countable set systems (Q1223296) (← links)
- On the number of systems of distinct representatives in an independence structure (Q1227011) (← links)
- More on complementary trees (Q1229877) (← links)
- Transversal theory and rank functions (Q1241444) (← links)
- Methods of invariant analysis for linear control systems. (Q1270540) (← links)
- Compatible systems of representatives (Q1336656) (← links)
- Colorful linear programming, Nash equilibrium, and pivots (Q1707915) (← links)
- On the intersection of independence systems (Q1785309) (← links)
- Identifying restrictions of linear equations with applications to simultaneous equations and cointegration (Q1899243) (← links)
- A proof of Rado's theorem via principal extension (Q2020030) (← links)
- Envy-free matchings with one-sided preferences and matroid constraints (Q2060385) (← links)
- Intersection pairings for higher laminations (Q2065708) (← links)
- Measurable equidecompositions for group actions with an expansion property (Q2098198) (← links)
- Packing of arborescences with matroid constraints via matroid intersection (Q2188242) (← links)
- Simplicial generation of Chow rings of matroids (Q2199846) (← links)
- Tropical Kirchhoff's formula and postoptimality in matroid optimization (Q2217458) (← links)
- Operator scaling: theory and applications (Q2309517) (← links)
- On matchable subsets in abelian groups and their linear analogues (Q2332379) (← links)
- Generalized Wong sequences and their applications to Edmonds' problems (Q2353409) (← links)
- Applications of Menger's graph theorem (Q2527630) (← links)
- Submodular functions and independence structures (Q2531038) (← links)
- Comments on certain combinatorial theorems of Ford and Fulkerson (Q2531285) (← links)
- Transversal theory and the study of abstract independence (Q2536527) (← links)
- Generalized versions of Hall's theorem (Q2550391) (← links)
- The rank formula of Nash-Williams as a source of covering and packing theorems (Q2562089) (← links)
- From output feedback pole-assignment to robust stabilization (Q2564012) (← links)
- On partitioning two matroids into common independent subsets (Q2570121) (← links)
- On a Generalization of the Ryser-Brualdi-Stein Conjecture (Q2940993) (← links)
- A Survey on Covering Supermodular Functions (Q2971606) (← links)
- Theory of Principal Partitions Revisited (Q2971607) (← links)
- Complementary Trees and Independent Matchings (Q4063168) (← links)
- (Q4277394) (← links)
- Matching theorems for combinatorial geometries (Q4405177) (← links)
- Partitioned transversals (Q4772993) (← links)
- A Structural Approach to State-to-Output Decoupling (Q4961447) (← links)
- Rainbow Odd Cycles (Q5157392) (← links)
- Approximation Limitations of Pure Dynamic Programming (Q5216795) (← links)
