A THEOREM ON INDEPENDENCE RELATIONS

Cited in

(78)

Multicolored parallelisms of Hamiltonian cycles
Generalized polymatroids and submodular flows
An application of submodular flows
Multicolored forests in bipartite decompositions of graphs
The notion and basic properties of M-transversals
Independent transversals for countable set systems
On the number of systems of distinct representatives in an independence structure
More on complementary trees
Transversal theory and rank functions
Methods of invariant analysis for linear control systems.
Compatible systems of representatives
Colorful linear programming, Nash equilibrium, and pivots
On the intersection of independence systems
Identifying restrictions of linear equations with applications to simultaneous equations and cointegration
A proof of Rado's theorem via principal extension
Envy-free matchings with one-sided preferences and matroid constraints
Intersection pairings for higher laminations
Measurable equidecompositions for group actions with an expansion property
Packing of arborescences with matroid constraints via matroid intersection
Simplicial generation of Chow rings of matroids
Tropical Kirchhoff's formula and postoptimality in matroid optimization
Operator scaling: theory and applications
On matchable subsets in abelian groups and their linear analogues
Generalized Wong sequences and their applications to Edmonds' problems
Applications of Menger's graph theorem
Submodular functions and independence structures
Comments on certain combinatorial theorems of Ford and Fulkerson
Transversal theory and the study of abstract independence
Generalized versions of Hall's theorem
The rank formula of Nash-Williams as a source of covering and packing theorems
From output feedback pole-assignment to robust stabilization
On partitioning two matroids into common independent subsets
Packing Steiner trees
A remark on strict independence relations
On a generalization of the Ryser-Brualdi-Stein conjecture
A Survey on Covering Supermodular Functions
Theory of principal partitions revisited
Reconstructing binary matrices with timetabling constraints
Complementary Trees and Independent Matchings
scientific article; zbMATH DE number 495474 (Why is no real title available?)
Matching theorems for combinatorial geometries
Spanning trees with specified differences in Cayley graphs
Greedy algorithms and poset matroids
Partitioned transversals
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
A structural approach to state-to-output decoupling
Rainbow Odd Cycles
Approximation limitations of pure dynamic programming
Properties and consequences of Thorn-independence
scientific article; zbMATH DE number 3298861 (Why is no real title available?)
Matching Theory for Combinatorial Geometries
scientific article; zbMATH DE number 3375554 (Why is no real title available?)
Systems of representatives
Matroids and linking systems
Conditions for matchability in groups and field extensions
Rota's basis conjecture for matroids with density close to one
Choice functions
Exponential sums equations and tropical geometry
On Fair Division under Heterogeneous Matroid Constraints
Unified Greedy Approximability beyond Submodular Maximization
Unified greedy approximability beyond submodular maximization
Matching subspaces in a field extension.
Matchings in matroids over abelian groups
Simplicial generation of Chow rings of matroids
Monotonic decompositions of submodular set functions
Non-overshooting output shaping for switched linear systems under arbitrary switching using eigenstructure assignment
Hall's marriage theorem
On the \(k\)-volume rigidity of a simplicial complex in \(\mathbb{R}^d\)
Hyperplane covers of finite spaces and applications
On codes with unique decoding to the nearest
Strongly stable matchings under matroid constraints
Straightening laws for Chow rings of matroids
Tropical geometry of Rado matroids
On complete classes of valuated matroids
Characterization of matchable sets and subspaces via Dyson transforms
Incremental maximization for a broad class of objectives
Some identification problems in the cointegrated vector autoregressive model
Theories with the independence property

This page was built for publication: A THEOREM ON INDEPENDENCE RELATIONS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5845425)