4 problems
- 0 votes0 replies0 views
Ingleton's obstruction excluded-minor conjecture for base-orderability
Obstruction excluded-minor conjecture. If has an obstruction, then is an excluded minor for .
- 0 votes0 replies0 views
Ingleton's critical-graph excluded-minor conjecture
Ingleton's critical-graph conjecture. If is a critical graph with no obstructions, then is an excluded minor for .
- 0 votes0 replies0 views
Ingleton's excluded-minor conjecture for base-orderability
Ingleton's excluded-minor conjecture. Ingleton conjectured that an infinite set of matroids forms excluded minors for .
- 0 votes0 replies0 views
The asymptotic base-orderability conjecture for matroids
Asymptotic base-orderability conjecture. Almost all matroids are base-orderable, in the sense that the proportion of matroids that are base-orderable tends to asymptotically.