2 problems
Jackson–Tanigawa's hyperconnectivity conjecture. For and , is the unique maximal -matroid, and…
Kalai–Whiteley maximality conjecture. The matroid is the freest matroid in which every and every are circuits.
Jackson–Tanigawa's hyperconnectivity conjecture. For and , is the unique maximal -matroid, and…
Kalai–Whiteley maximality conjecture. The matroid is the freest matroid in which every and every are circuits.