The bounded connectivity conjecture for breadth-critical tangles
The bounded connectivity conjecture for breadth-critical tangles
Let and let be a matroid with a breadth-critical tangle of order at least . A matroid is -connected if, whenever has for , either or . The bounded connectivity conjecture. There is an infinite sequence such that, for all , if is a breadth-critical tangle of order at least in , then is -connected. This would extend the established fact that breadth-critical tangles of order at least occur in weakly -connected, equivalently -connected, matroids; the existence of a uniform sequence for all orders remains open.
Sources & referencesView supporting material
Primary source
Nick Brettell, Susan Jowett, James Oxley, Charles Semple and Geoff Whittle, “What is a 4-connected matroid?”, arXiv:2310.08832 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.