Matching Number Calculator

max independent edges

All Tools

Loading tool...

About Matching Number Calculator

A matching number calculator computing ν(G): maximum number of independent edges. Gallai's theorem: α(G)+ν(G)=n for graphs without isolated vertices. König's theorem: ν(G)=τ(G) for bipartite graphs. Perfect matching: ν=n/2. Client-side.

Matching Number Calculator Features

  • ν(G) value
  • Perfect matching?
  • Gallai theorem
  • König theorem
  • Common graphs
Advertisement
Advertisement