Some Generalizations of the Problem of Distinct Representatives
From MaRDI portal
Cited in
(20)- Transversal theory and rank functions
- A note on generalization of distinct representatives
- Base polyhedra and the linking property
- Packing paths of length at least two
- A \(2/3\)-approximation algorithm for vertex-weighted matching
- Matching numbers in fuzzy graphs
- Applications of Menger's graph theorem
- Term ranks and permanents of nonnegative matrices
- Hall's criterion as a 'self-refining' result
- A matroid generalization of a theorem of Mendelsohn and Dulmage
- On distinct representatives and mapping theorems
- The rank formula of Nash-Williams as a source of covering and packing theorems
- Matrices of zeros and ones
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- A 2/3-approximation algorithm for vertex weighted matching in bipartite graphs
- Approximation algorithms in combinatorial scientific computing
- A Very General Theorem on Systems of Distinct Representatives
- Systems of representatives
- Induced graph packing problems
- Optimal matchings in posets
This page was built for publication: Some Generalizations of the Problem of Distinct Representatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3250606)