1 problem

Matching

Strong maximality and minimality conjecture for bounded-edge hypergraphs
At least 16 years old
Strong maximality and minimality conjecture. Every such hypergraph has a strongly maximal matching, a strongly minimal vertex cover, and a strongly minimal edge cover.
opencovers hypergraph-theory matchings
015

Strong maximality and minimality conjecture for bounded-edge hypergraphs