The following pages link to Bounds on maximum \(b\)-matchings (Q1043589):
Displaying 10 items.
- Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700) (← links)
- Factorially many maximum matchings close to the Erdős-Gallai bound (Q2152791) (← links)
- Erratum to: Tight bound for matching (Q2392740) (← links)
- (Q3024804) (← links)
- Odd Minimum Cut Sets and <i>b</i>-Matchings Revisited (Q3648510) (← links)
- (Q4474098) (← links)
- Lower Bounds for Maximal Matchings and Maximal Independent Sets (Q5056427) (← links)
- A simply exponential upper bound on the maximum number of stable matchings (Q5230350) (← links)
- On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane (Q5951972) (← links)
- On maximum bipartite matching with separation (Q6161448) (← links)