All Questions
2 questions
6
votes
1
answer
538
views
Induced matching number
Definition:
A matching in a graph $G$ is a subgraph consisting of pairwise disjoint edges. If the subgraph is an induced subgraph, the matching is an induced matching. The largest size of an induced ...
- 32.1k
7
votes
1
answer
467
views
How does this algorithmic proof of Edmonds-Gallai work?
Sorry, this is going to be technical and dirty. I am not looking for a proof of the Edmonds-Gallai structure theorem (I understand two of them, even if they are rather similar); I am trying to ...
- 33.8k