maximum matching
functionally equivalent to: distance to edgeless, vertex cover
providers: ISGCI
Definition: The size of a maximum independent edge set.
Relations
Other | Relation from | Relation to | |
---|---|---|---|
acyclic chromatic number | ■ | exclusion | upper bound |
admissibility | ■ | exclusion | upper bound |
arboricity | ■ | exclusion | upper bound |
average degree | ■ | exclusion | upper bound |
average distance | ■ | exclusion | upper bound |
bandwidth | ■ | exclusion | exclusion |
bipartite | ■ | unbounded | exclusion |
bipartite number | ■ | exclusion | exclusion |
bisection bandwidth | ■ | exclusion | exclusion |
block | ■ | unbounded | exclusion |
book thickness | ■ | exclusion | upper bound |
boolean width | ■ | exclusion | upper bound |
bounded components | ■ | exclusion | exclusion |
bounded expansion | ■ | exclusion | upper bound |
boxicity | ■ | exclusion | upper bound |
branch width | ■ | exclusion | upper bound |
c-closure | ■ | exclusion | exclusion |
carving-width | ■ | exclusion | exclusion |
chi-bounded | ■ | exclusion | upper bound |
chordal | ■ | unbounded | exclusion |
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 | exclusion |
co-cluster | ■ | unbounded | exclusion |
cograph | ■ | unbounded | exclusion |
complete | ■ | unbounded | exclusion |
connected | ■ | exclusion | avoids |
contraction complexity | ■ | exclusion | exclusion |
cutwidth | ■ | exclusion | exclusion |
cycle | ■ | unknown to HOPS | exclusion |
cycles | ■ | unbounded | exclusion |
d-admissibility | ■ | exclusion | upper bound |
d-path-free | ■ | exclusion | upper bound |
degeneracy | ■ | exclusion | upper bound |
degree treewidth | ■ | exclusion | exclusion |
diameter | ■ | exclusion | upper bound |
diameter+max degree | ■ | exclusion | exclusion |
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 | ■ | tight bounds | upper bound |
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 |
domino treewidth | ■ | exclusion | exclusion |
edge clique cover number | ■ | exclusion | exclusion |
edge connectivity | ■ | exclusion | upper bound |
edge-cut width | ■ | exclusion | unknown to HOPS |
edge-treewidth | ■ | exclusion | unknown to HOPS |
edgeless | ■ | upper bound | avoids |
excluded minor | ■ | exclusion | unknown to HOPS |
excluded planar minor | ■ | unknown to HOPS | unknown to HOPS |
excluded top-minor | ■ | exclusion | upper bound |
feedback edge set | ■ | exclusion | exclusion |
feedback vertex set | ■ | exclusion | upper bound |
flip-width | ■ | exclusion | upper bound |
forest | ■ | unbounded | exclusion |
genus | ■ | exclusion | exclusion |
grid | ■ | unbounded | exclusion |
h-index | ■ | exclusion | upper bound |
interval | ■ | unbounded | exclusion |
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 | ■ | unknown to HOPS | exclusion |
maximum matching | ■ | equal | equal |
maximum matching on bipartite graphs | ■ | upper bound | exclusion |
merge-width | ■ | exclusion | 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 |
monadically dependent | ■ | exclusion | upper bound |
monadically stable | ■ | exclusion | upper bound |
neighborhood diversity | ■ | exclusion | upper bound |
NLC-width | ■ | exclusion | upper bound |
NLCT-width | ■ | exclusion | upper bound |
nowhere dense | ■ | exclusion | upper bound |
odd cycle transversal | ■ | exclusion | upper bound |
outerplanar | ■ | unknown to HOPS | exclusion |
overlap treewidth | ■ | exclusion | unknown to HOPS |
path | ■ | unbounded | exclusion |
pathwidth | ■ | exclusion | upper bound |
pathwidth+maxdegree | ■ | exclusion | exclusion |
perfect | ■ | unbounded | exclusion |
planar | ■ | unbounded | exclusion |
radius-inf flip-width | ■ | exclusion | upper bound |
radius-r flip-width | ■ | exclusion | upper bound |
rank-width | ■ | exclusion | upper bound |
series-parallel | ■ | unknown to HOPS | unknown to HOPS |
shrub-depth | ■ | exclusion | upper bound |
sim-width | ■ | exclusion | upper bound |
size | ■ | upper bound | exclusion |
slim tree-cut width | ■ | exclusion | unknown to HOPS |
sparse twin-width | ■ | exclusion | upper bound |
star | ■ | upper bound | exclusion |
stars | ■ | unbounded | exclusion |
strong coloring number | ■ | exclusion | upper bound |
strong d-coloring number | ■ | exclusion | upper bound |
strong inf-coloring number | ■ | exclusion | upper bound |
topological bandwidth | ■ | exclusion | exclusion |
tree | ■ | unbounded | exclusion |
tree-cut width | ■ | exclusion | unknown to HOPS |
tree-independence number | ■ | exclusion | upper bound |
tree-partition-width | ■ | exclusion | unknown to HOPS |
treebandwidth | ■ | exclusion | unknown to HOPS |
treedepth | ■ | exclusion | upper bound |
treelength | ■ | exclusion | upper bound |
treespan | ■ | exclusion | exclusion |
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 | ■ | tight bounds | upper bound |
vertex integrity | ■ | exclusion | upper bound |
weak coloring number | ■ | exclusion | upper bound |
weak d-coloring number | ■ | exclusion | upper bound |
weak inf-coloring number | ■ | exclusion | upper bound |
weakly sparse | ■ | exclusion | upper bound |
weakly sparse and merge width | ■ | exclusion | upper bound |
Results
- 2025 On a tree-based variant of bandwidth and forbidding simple topological minors by Jacob, Lochet, Paul
- page 36 : vertex cover upper and lower bounds maximum matching by a linear function – … discovered independently by Fanica Gavril and Mihalis Yannakakis. Theorem 50. In a graph $G$, we have $\mu(G) \le {\rm vc}(G) \le 2\mu(G)$, where $\mu(G)$ is the maximum matching number of $G$.
- page 36 : maximum matching upper bounds vertex cover by a linear function – … discovered independently by Fanica Gavril and Mihalis Yannakakis. Theorem 50. In a graph $G$, we have $\mu(G) \le {\rm vc}(G) \le 2\mu(G)$, where $\mu(G)$ is the maximum matching number of $G$.
- 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
- maximum matching is equivalent to maximum matching – assumed
- unknown source
- graph class complete is not constant maximum matching
- graph class path is not constant maximum matching
- star upper bounds maximum matching by a constant
- edgeless upper bounds maximum matching by a constant