The following pages link to Jim Geelen (Q273160):
Displaying 50 items.
- On Rota's conjecture and nested separations in matroids (Q273161) (← links)
- Inequivalent representations of matroids over prime fields (Q394760) (← links)
- A geometric version of the Andrásfai-Erdős-Sós theorem (Q404285) (← links)
- Characterizing graphic matroids by a system of linear equations (Q461731) (← links)
- On inequivalent representations of matroids over non-prime fields (Q602729) (← links)
- Explicit bounds for graph minors (Q723881) (← links)
- Packing non-zero \(A\)-paths in group-labelled graphs (Q879161) (← links)
- Certifying non-representability of matroids over prime fields (Q905894) (← links)
- An algorithm for packing non-zero \(A\)-paths in group-labelled graphs (Q949790) (← links)
- Some open problems on excluding a uniform matroid (Q953908) (← links)
- The projective plane is a stabilizer (Q965240) (← links)
- The Erdös-Pósa property for matroid circuits (Q1003843) (← links)
- Growth rates of minor-closed classes of matroids (Q1003844) (← links)
- Tangles, tree-decompositions and grids in matroids (Q1026005) (← links)
- Computing girth and cogirth in perturbed graphic matroids (Q1747998) (← links)
- Infinitely many excluded minors for frame matroids and for lifted-graphic matroids (Q1791702) (← links)
- A short proof of non-GF(5)-representability of matroids (Q1826956) (← links)
- Inequivalent representations of matroids having no \(U_{3,6}\)-minor (Q1880789) (← links)
- Matroid fragility and relaxations of circuit hyperplanes (Q1985443) (← links)
- Disjoint non-balanced \(A\)-paths in biased graphs (Q2020032) (← links)
- The grid theorem for vertex-minors (Q2099410) (← links)
- On the complex-representable excluded minors for real-representability (Q2173426) (← links)
- Small cocircuits in matroids (Q2275470) (← links)
- Improved bounds for Rota's basis conjecture (Q2322501) (← links)
- Matroid 3-connectivity and branch width (Q2343289) (← links)
- Representability of matroids with a large projective geometry minor (Q2343293) (← links)
- The highly connected matroids in minor-closed classes (Q2343467) (← links)
- Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids (Q2384806) (← links)
- Generating weakly 4-connected matroids (Q2483478) (← links)
- On Rota's conjecture and excluded minors containing large projective geometries. (Q2490840) (← links)
- Obstructions to branch-decomposition of matroids (Q2496205) (← links)
- Projective geometries in dense matroids (Q2519009) (← links)
- On the odd-minor variant of Hadwiger's conjecture (Q2519011) (← links)
- Excluding a group-labelled graph (Q2519025) (← links)
- Solving Rota's Conjecture (Q2813214) (← links)
- Structure in minor-closed classes of matroids (Q2875861) (← links)
- Regular matroid decomposition via signed graphs (Q3159390) (← links)
- (Q3447280) (← links)
- On Rota's Basis Conjecture (Q3519212) (← links)
- Straight line embeddings of cubic planar graphs with integer edge lengths (Q3522854) (← links)
- Circle graph obstructions under pivoting (Q3633003) (← links)
- Quasi‐graphic matroids* (Q4604030) (← links)
- Bridging Separations in Matroids (Q5317576) (← links)
- Rota’s Basis Conjecture for Paving Matroids (Q5426889) (← links)
- On Integer Programming and the Branch-Width of the Constraint Matrix (Q5429265) (← links)
- (Q5491014) (← links)
- A Splitter Theorem for Internally 4‐Connected Binary Matroids (Q5757374) (← links)
- Matroid <i>T</i>‐Connectivity (Q5757375) (← links)
- Average plane-size in complex-representable matroids (Q6513417) (← links)
- Excluding a line from complex-representable matroids (Q6661171) (← links)
