maximum matching
equivalent to: maximum matching
providers: ISGCI
Relations
| Other | Relation from | Relation to |
|---|---|---|
| acyclic chromatic number | exclusion | unknown to HOPS |
| arboricity | exclusion | unknown to HOPS |
| average degree | exclusion | unknown to HOPS |
| average distance | exclusion | upper bound |
| bandwidth | exclusion | exclusion |
| bipartite | unbounded | unknown to HOPS |
| bipartite number | exclusion | upper bound |
| bisection bandwidth | exclusion | exclusion |
| block | unbounded | unknown to HOPS |
| book thickness | exclusion | unknown to HOPS |
| boolean width | exclusion | unknown to HOPS |
| bounded components | unknown to HOPS | exclusion |
| boxicity | exclusion | unknown to HOPS |
| branch width | exclusion | unknown to HOPS |
| c-closure | exclusion | exclusion |
| carving-width | exclusion | exclusion |
| chordal | unbounded | unknown to HOPS |
| chordality | exclusion | unknown to HOPS |
| chromatic number | exclusion | unknown to HOPS |
| clique cover number | exclusion | exclusion |
| clique-tree-width | exclusion | unknown to HOPS |
| clique-width | exclusion | unknown to HOPS |
| cluster | unbounded | unknown to HOPS |
| co-cluster | unbounded | unknown to HOPS |
| cograph | unbounded | unknown to HOPS |
| complete | unbounded | exclusion |
| connected | unbounded | unknown to HOPS |
| cutwidth | exclusion | exclusion |
| cycle | unbounded | exclusion |
| cycles | unbounded | exclusion |
| d-path-free | unknown to HOPS | unknown to HOPS |
| degeneracy | exclusion | unknown to HOPS |
| degree treewidth | exclusion | exclusion |
| diameter | exclusion | upper bound |
| diameter+max degree | unknown to HOPS | exclusion |
| disjoint cycles | unbounded | exclusion |
| distance to bipartite | exclusion | unknown to HOPS |
| distance to block | exclusion | unknown to HOPS |
| distance to bounded components | unknown to HOPS | unknown to HOPS |
| distance to chordal | exclusion | unknown to HOPS |
| distance to cluster | exclusion | unknown to HOPS |
| distance to co-cluster | exclusion | unknown to HOPS |
| distance to cograph | exclusion | unknown to HOPS |
| distance to complete | exclusion | exclusion |
| distance to edgeless | tight bounds | unknown to HOPS |
| distance to forest | exclusion | unknown to HOPS |
| distance to interval | exclusion | unknown to HOPS |
| distance to linear forest | exclusion | unknown to HOPS |
| distance to maximum degree | exclusion | unknown to HOPS |
| distance to outerplanar | exclusion | unknown to HOPS |
| distance to perfect | exclusion | unknown to HOPS |
| distance to planar | exclusion | unknown to HOPS |
| distance to stars | unknown to HOPS | unknown to HOPS |
| domatic number | exclusion | unknown to HOPS |
| domination number | exclusion | exclusion |
| edge clique cover number | exclusion | exclusion |
| edge connectivity | exclusion | unknown to HOPS |
| edgeless | constant | exclusion |
| feedback edge set | exclusion | exclusion |
| feedback vertex set | exclusion | unknown to HOPS |
| forest | unbounded | exclusion |
| genus | exclusion | exclusion |
| girth | exclusion | upper bound |
| grid | unbounded | exclusion |
| h-index | exclusion | unknown to HOPS |
| inf-flip-width | exclusion | unknown to HOPS |
| interval | unbounded | unknown to HOPS |
| iterated type partitions | exclusion | unknown to HOPS |
| linear clique-width | exclusion | unknown to HOPS |
| linear forest | unbounded | exclusion |
| linear NLC-width | exclusion | unknown to HOPS |
| linear rank-width | exclusion | unknown to HOPS |
| maximum clique | exclusion | unknown to HOPS |
| maximum degree | exclusion | exclusion |
| maximum independent set | exclusion | exclusion |
| maximum induced matching | exclusion | upper bound |
| maximum leaf number | exclusion | exclusion |
| maximum matching on bipartite graphs | upper bound | unknown to HOPS |
| mim-width | exclusion | unknown to HOPS |
| minimum degree | exclusion | unknown to HOPS |
| mm-width | exclusion | unknown to HOPS |
| modular-width | exclusion | unknown to HOPS |
| module-width | exclusion | unknown to HOPS |
| neighborhood diversity | exclusion | unknown to HOPS |
| NLC-width | exclusion | unknown to HOPS |
| NLCT-width | exclusion | unknown to HOPS |
| odd cycle transversal | exclusion | unknown to HOPS |
| outerplanar | unbounded | exclusion |
| path | unbounded | exclusion |
| pathwidth | exclusion | unknown to HOPS |
| pathwidth+maxdegree | exclusion | exclusion |
| perfect | unbounded | unknown to HOPS |
| planar | unbounded | exclusion |
| radius-r flip-width | exclusion | unknown to HOPS |
| rank-width | exclusion | unknown to HOPS |
| shrub-depth | exclusion | unknown to HOPS |
| sim-width | exclusion | unknown to HOPS |
| star | constant | exclusion |
| stars | unknown to HOPS | exclusion |
| topological bandwidth | exclusion | exclusion |
| tree | unbounded | exclusion |
| tree-independence number | exclusion | unknown to HOPS |
| treedepth | unknown to HOPS | unknown to HOPS |
| treelength | exclusion | upper bound |
| treewidth | exclusion | unknown to HOPS |
| twin-cover number | exclusion | unknown to HOPS |
| twin-width | exclusion | unknown to HOPS |
| vertex connectivity | unknown to HOPS | unknown to HOPS |
| vertex cover | tight bounds | unknown to HOPS |
| vertex integrity | unknown to HOPS | unknown to HOPS |
Results
- assumed
- maximum matching upper bounds maximum induced matching by a linear function – By definition
- maximum matching on bipartite graphs upper bounds maximum matching by a linear function – by definition
- unknown source
- vertex cover upper and lower bounds maximum matching by a linear function – Every edge of the matching needs to be covered by at least one vertex. Path shows lower bound.
- graph class complete has unbounded maximum matching
- graph class path has unbounded maximum matching
- graph class star has constant maximum matching
- graph class edgeless has constant maximum matching
- https://www.graphclasses.org/classes/par_13.html
- maximum matching – A matching in a graph is a subset of pairwise disjoint edges (any two edges that do not share an endpoint). The parameter maximum matching of a graph $G$ is the largest size of a matching in $G$.