2 problems
- 0 votes0 replies0 views
Füredi–Gyárfás–Simonyi conjecture on connected matchings
Füredi–Gyárfás–Simonyi conjecture.
- 0 votes0 replies0 views
Efficient verification conjecture for connected-matching facet conditions
Let be the graph under consideration, let and be the two distinguished edges, and let be the set of edges removed in the theorem's hypot…