Recommendations
- From matchings to independent sets
- Independent set and matching permutations
- Independent sets, matchings, and occupancy fractions
- Problems on matchings and independent sets of a graph
- Matchings and independent sets of a fixed size in regular graphs
- Independent sets and matchings in subcubic graphs
- Independence and matching number of some graphs
- Graphs with independent perfect matchings
- Independent domination and matchings in graphs
- Lower Bounds for Maximal Matchings and Maximal Independent Sets
Cites work
Cited in
(13)- Matchings and independent sets of a fixed size in regular graphs
- Constructing a perfect matching is in random NC
- On asymmetric matching between sets
- Random parallel algorithms for finding exact branchings, perfect matchings, and cycles
- Relating dissociation, independence, and matchings
- New results relating independence and matchings
- From matchings to independent sets
- Existence of independent random matching
- scientific article; zbMATH DE number 1303038 (Why is no real title available?)
- Independent set and matching permutations
- Parallel discrete sampling via continuous walks
- Parallelize single-site dynamics up to Dobrushin criterion
- Sampling arborescences in parallel
This page was built for publication: Independent sets versus perfect matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673116)
