maximum matching on bipartite graphs
equivalent to: maximum matching on bipartite graphs
Relations
| Other | Relation from | Relation to |
|---|---|---|
| acyclic chromatic number | exclusion | upper bound |
| arboricity | exclusion | upper bound |
| average degree | exclusion | upper bound |
| average distance | exclusion | upper bound |
| bandwidth | exclusion | exclusion |
| bipartite | unbounded | inclusion |
| bipartite number | exclusion | upper bound |
| bisection bandwidth | exclusion | unknown to HOPS |
| block | unbounded | unknown to HOPS |
| book thickness | exclusion | upper bound |
| boolean width | exclusion | upper bound |
| bounded components | exclusion | exclusion |
| boxicity | exclusion | upper bound |
| branch width | exclusion | upper bound |
| c-closure | exclusion | unknown to HOPS |
| carving-width | exclusion | exclusion |
| chordal | unbounded | unknown to HOPS |
| chordality | exclusion | upper bound |
| chromatic number | exclusion | upper bound |
| clique cover number | exclusion | exclusion |
| clique-tree-width | exclusion | upper bound |
| clique-width | exclusion | upper bound |
| 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 | exclusion | upper bound |
| degeneracy | exclusion | upper bound |
| degree treewidth | exclusion | exclusion |
| diameter | exclusion | upper bound |
| diameter+max degree | exclusion | exclusion |
| disjoint cycles | unbounded | unknown to HOPS |
| distance to bipartite | exclusion | upper bound |
| distance to block | exclusion | upper bound |
| distance to bounded components | exclusion | upper bound |
| distance to chordal | exclusion | upper bound |
| distance to cluster | exclusion | upper bound |
| distance to co-cluster | exclusion | upper bound |
| distance to cograph | exclusion | upper bound |
| distance to complete | exclusion | exclusion |
| distance to edgeless | unknown to HOPS | tight bounds |
| distance to forest | exclusion | upper bound |
| distance to interval | exclusion | upper bound |
| distance to linear forest | exclusion | upper bound |
| distance to maximum degree | exclusion | upper bound |
| distance to outerplanar | exclusion | upper bound |
| distance to perfect | exclusion | upper bound |
| distance to planar | exclusion | upper bound |
| distance to stars | exclusion | upper bound |
| domatic number | exclusion | upper bound |
| domination number | exclusion | exclusion |
| edge clique cover number | exclusion | unknown to HOPS |
| edge connectivity | exclusion | upper bound |
| edgeless | constant | exclusion |
| feedback edge set | exclusion | unknown to HOPS |
| feedback vertex set | exclusion | upper bound |
| forest | unbounded | unknown to HOPS |
| genus | exclusion | unknown to HOPS |
| girth | exclusion | upper bound |
| grid | unbounded | exclusion |
| h-index | exclusion | upper bound |
| inf-flip-width | exclusion | upper bound |
| interval | unbounded | unknown to HOPS |
| iterated type partitions | exclusion | upper bound |
| linear clique-width | exclusion | upper bound |
| linear forest | unbounded | exclusion |
| linear NLC-width | exclusion | upper bound |
| linear rank-width | exclusion | upper bound |
| maximum clique | exclusion | upper bound |
| maximum degree | exclusion | exclusion |
| maximum independent set | exclusion | exclusion |
| maximum induced matching | exclusion | upper bound |
| maximum leaf number | exclusion | exclusion |
| maximum matching | unknown to HOPS | upper bound |
| mim-width | exclusion | upper bound |
| minimum degree | exclusion | upper bound |
| mm-width | exclusion | upper bound |
| modular-width | exclusion | upper bound |
| module-width | exclusion | upper bound |
| neighborhood diversity | exclusion | upper bound |
| NLC-width | exclusion | upper bound |
| NLCT-width | exclusion | upper bound |
| odd cycle transversal | exclusion | upper bound |
| outerplanar | unbounded | unknown to HOPS |
| path | unbounded | exclusion |
| pathwidth | exclusion | upper bound |
| pathwidth+maxdegree | exclusion | exclusion |
| perfect | unbounded | inclusion |
| planar | unbounded | unknown to HOPS |
| radius-r flip-width | exclusion | upper bound |
| rank-width | exclusion | upper bound |
| shrub-depth | exclusion | upper bound |
| sim-width | exclusion | upper bound |
| star | constant | unknown to HOPS |
| stars | unbounded | unknown to HOPS |
| topological bandwidth | exclusion | unknown to HOPS |
| tree | unbounded | unknown to HOPS |
| tree-independence number | exclusion | upper bound |
| treedepth | exclusion | upper bound |
| treelength | exclusion | upper bound |
| treewidth | exclusion | upper bound |
| twin-cover number | exclusion | upper bound |
| twin-width | exclusion | upper bound |
| vertex connectivity | unknown to HOPS | unknown to HOPS |
| vertex cover | unknown to HOPS | tight bounds |
| vertex integrity | exclusion | upper bound |
Results
- assumed
- graphs with bounded maximum matching on bipartite graphs are included in graph class bipartite – by definition
- maximum matching on bipartite graphs upper bounds maximum matching by a linear function – by definition
- unknown source
- maximum matching on bipartite graphs upper and lower bounds vertex cover by a linear function – Kőnig’s theorem