2 problems
- 0 votes0 replies0 views
Strong maximality and minimality conjecture for bounded-edge hypergraphs
Strong maximality and minimality conjecture. Every such hypergraph has a strongly maximal matching, a strongly minimal vertex cover, and a strongly minimal edge cover.
- 0 votes0 replies1 view
The unramified-cover obstruction to the Hilbert property
Let be a variety over a finitely generated field of characteristic zero, and suppose that is Zariski-dense. Unramified-cover obstruction conjecture. The only obstruc…