query: edge cover number + matching number = $|V|$
positive_passages.docid: 154564
positive_passages.text: Prove that the sum of minimum edge cover and maximum matching is the vertex count
negative_passages.docid: 31012
negative_passages.text: How to find the minimum perimeter oriented bounding box?
negative_passages.docid: 83131
negative_passages.text: Centering \vdots in a system of many equations
negative_passages.docid: 92870
negative_passages.text: composition of covering maps
negative_passages.docid: 81928
negative_passages.text: Covering with most possible equal size subsets having pairwise singleton intersections
negative_passages.docid: 145181
negative_passages.text: How can I prove the maximum number of edges?
negative_passages.docid: 137146
negative_passages.text: How to round the edges of this object?
negative_passages.docid: 130616
negative_passages.text: Split an edge in two?
negative_passages.docid: 95010
negative_passages.text: How to introduce an edge where two faces intersect
negative_passages.docid: 5448
negative_passages.text: Finding the closure of some subsets of the ordered square
negative_passages.docid: 81375
negative_passages.text: Why does $V(I(S))=\overline{S}$?
negative_passages.docid: 122998
negative_passages.text: number of edges induction proof
negative_passages.docid: 49879
negative_passages.text: A bipartite graph with a perfect matching has a vertex with each edge contained in a perfect matching
negative_passages.docid: 40080
negative_passages.text: Sum of multiples of $2$ coprime numbers cover positive integers
negative_passages.docid: 97627
negative_passages.text: filling an occluded plane with the smallest number of rectangles
negative_passages.docid: 34210
negative_passages.text: Connecting square vertexes with minimal road
negative_passages.docid: 97357
negative_passages.text: How many elements in a number field of a given norm?