6 problems
- 0 votes0 replies0 views
Johnson–Robertson–Seymour branch-width obstruction conjecture for matroids
Johnson–Robertson–Seymour's branch-width obstruction conjecture. For every positive integer , there is an integer such that every matroid of branch-width at least contai…
- 0 votes0 replies0 views
Geelen–Gerards–Whittle conjecture on branch-width under circuit-hyperplane relaxation
Let be a matroid with a circuit-hyperplane , and let be obtained from by relaxing . If both and are representable over a finite field…
- 0 votes0 replies0 views
Geelen–Gerards–Whittle's matroid structure theorem
Matroid structure theorem. The stated tree-decomposition exists.
- 0 votes0 replies0 views
Geelen–Gerards–Whittle bounded branch-width conjecture for fragile matroids
Let be a prime power, let be a matroid representable over , and call a matroid -fragile if, for every element , at least one of its deletion or…
- 0 votes0 replies0 views
The high-branch-width non-fragility conjecture
Let be a -representable matroid, and let denote the branch width of a matroid . High-branch-width non-fragility conjecture. Ther…
- 0 votes0 replies0 views
The Bounded Canopy Conjecture for representable matroids
Fix a matroid . A matroid is -fragile if, for every , at least one of and has no -minor. Bounded Canopy Conjecture. For every prime power …