On Rota's Conjecture and nested separations in matroids

2013/10/25 by Shalev Ben-David, Jim Geelen, Ben-David, Shalev +1
Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Limits and Structures in Graph Theory #math.CO

paper · pdf · doi:10.48550/arxiv.1310.6990

12 pages. This revised version includes revisions suggested by referees. The paper will appear in JCTb

arxiv created 2015/11/10 · arxiv updated 2015/11/12

Abstract

We prove that for each finite field \mathbb F and integer k∈ \mathbb Z there exists n∈ \mathbb Z such that no excluded minor for the class of \mathbb F-representable matroids has n nested k-separations.

Related

• Stability, fragility, and Rota's Conjecture
• On the complex-representable excluded minors for real-representability
• Representation of matroids with a modular plane
• Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
• The Highly Connected Matroids in Minor-closed Classes