# Hierarchical b-Matching

A matching of a graph is a subset of edges no two of which share a common vertex, and a maximum matching is a matching of maximum cardinality. In a b-matching every vertex v has an associated bound b_v, and a maximum b-matching is a maximum set of edges, such that every vertex v appears in at most b_v of them. We study an extension of this problem, termed Hierarchical b-Matching. In this extension, the vertices are arranged in a hierarchical manner. At the first level the vertices are partitioned into disjoint subsets, with a given bound for each subset. At the second level the set of these subsets is again partitioned into disjoint subsets, with a given bound for each subset, and so on. In an Hierarchical b-matching we look for a maximum set of edges, that will obey all bounds (that is, no vertex v participates in more than b_v edges, then all the vertices in one subset do not participate in more that that subset's bound of edges, and so on hierarchically). We propose a polynomial-time algorithm for this new problem, that works for any number of levels of this hierarchical structure.

• 21 publications
• 19 publications
• 6 publications
• 2 publications
10/16/2020

### Supercards, Sunshines and Caterpillar Graphs

The vertex-deleted subgraph G-v, obtained from the graph G by deleting t...
10/18/2022

### A Note on Robust Subsets of Transversal Matroids

Robust subsets of matroids were introduced by Huang and Sellier to propo...
09/04/2019

### A greedoid and a matroid inspired by Bhargava's p-orderings

Consider a finite set E equipped with a "weight function" w : E →R and a...
08/20/2022

### Minimizing Visible Edges in Polyhedra

We prove that, given a polyhedron 𝒫 in ℝ^3, every point in ℝ^3 that does...
07/17/2018

### A tight lower bound for the hardness of clutters

A clutter (or antichain or Sperner family) L is a pair (V,E), where V...
04/26/2023

### Reconfiguration of the Union of Arborescences

An arborescence in a digraph is an acyclic arc subset in which every ver...
01/25/2023