Jim Geelen

MaRDI QIDQ273160zbMATH OpenDBLPWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Unavoidable flats in matroids representable over prime fields Combinatorica	2025-01-14	Paper
A Sylvester-Gallai-type theorem for complex-representable matroids Discrete & Computational Geometry	2025-01-14	Paper
Excluding a line from complex-representable matroids Memoirs of the American Mathematical Society	2025-01-13	Paper
Unavoidable flats in matroids representable over prime fields	2023-09-26	Paper
A Sylvester-Gallai-type theorem for complex-representable matroids	2022-12-06	Paper
The grid theorem for vertex-minors Journal of Combinatorial Theory. Series B	2022-11-23	Paper
Disjoint non-balanced \(A\)-paths in biased graphs Advances in Applied Mathematics	2021-04-23	Paper
Excluding a line from $\mathbb C$-representable matroids	2021-01-28	Paper
On the complex-representable excluded minors for real-representability Journal of Combinatorial Theory. Series B	2020-04-22	Paper
Matroid fragility and relaxations of circuit hyperplanes Journal of Combinatorial Theory. Series B	2020-04-07	Paper
Improved bounds for Rota's basis conjecture Combinatorica	2019-09-04	Paper
Infinitely many excluded minors for frame matroids and for lifted-graphic matroids Journal of Combinatorial Theory. Series B	2018-10-11	Paper
Explicit bounds for graph minors Journal of Combinatorial Theory. Series B	2018-07-24	Paper
Computing girth and cogirth in perturbed graphic matroids Combinatorica	2018-04-27	Paper
Quasi-graphic matroids Journal of Graph Theory	2018-02-23	Paper
A generalization of the Grid Theorem	2016-09-28	Paper
Solving Rota's conjecture Notices of the American Mathematical Society	2016-06-15	Paper
On Rota's conjecture and nested separations in matroids Journal of Combinatorial Theory. Series B	2016-04-21	Paper
Certifying non-representability of matroids over prime fields Journal of Combinatorial Theory. Series B	2016-01-28	Paper
The highly connected matroids in minor-closed classes Annals of Combinatorics	2015-05-05	Paper
Representability of matroids with a large projective geometry minor Journal of Combinatorial Theory. Series B	2015-05-04	Paper
Matroid 3-connectivity and branch width Journal of Combinatorial Theory. Series B	2015-05-04	Paper
On the structure of dense triangle-free binary matroids	2015-03-31	Paper
Characterizing graphic matroids by a system of linear equations Journal of Combinatorial Theory. Series B	2014-10-13	Paper
A geometric version of the Andrásfai-Erdős-Sós theorem Advances in Applied Mathematics	2014-09-04	Paper
Structure in minor-closed classes of matroids Surveys in Combinatorics 2013	2014-08-12	Paper
Inequivalent representations of matroids over prime fields Advances in Applied Mathematics	2014-01-27	Paper
Representation of matroids with a modular plane	2013-04-23	Paper
Small cocircuits in matroids European Journal of Combinatorics	2011-08-09	Paper
On inequivalent representations of matroids over non-prime fields Journal of Combinatorial Theory. Series B	2010-11-05	Paper
The projective plane is a stabilizer Journal of Combinatorial Theory. Series B	2010-04-21	Paper
Tangles, tree-decompositions and grids in matroids Journal of Combinatorial Theory. Series B	2009-06-23	Paper
Circle graph obstructions under pivoting Journal of Graph Theory	2009-06-16	Paper
Growth rates of minor-closed classes of matroids Journal of Combinatorial Theory. Series B	2009-03-04	Paper
The Erdös-Pósa property for matroid circuits Journal of Combinatorial Theory. Series B	2009-03-04	Paper
On the odd-minor variant of Hadwiger's conjecture Journal of Combinatorial Theory. Series B	2009-01-21	Paper
Projective geometries in dense matroids Journal of Combinatorial Theory. Series B	2009-01-21	Paper
Excluding a group-labelled graph Journal of Combinatorial Theory. Series B	2009-01-21	Paper
Some open problems on excluding a uniform matroid Advances in Applied Mathematics	2008-11-06	Paper
An algorithm for packing non-zero \(A\)-paths in group-labelled graphs Combinatorica	2008-10-21	Paper
Straight line embeddings of cubic planar graphs with integer edge lengths Journal of Graph Theory	2008-09-04	Paper
On Rota's Basis Conjecture SIAM Journal on Discrete Mathematics	2008-08-13	Paper
Generating weakly 4-connected matroids Journal of Combinatorial Theory. Series B	2008-04-28	Paper
On Integer Programming and the Branch-Width of the Constraint Matrix Integer Programming and Combinatorial Optimization	2007-11-29	Paper
Rota’s Basis Conjecture for Paving Matroids SIAM Journal on Discrete Mathematics	2007-11-16	Paper
Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids Journal of Combinatorial Theory. Series B	2007-10-10	Paper
A Splitter Theorem for Internally 4‐Connected Binary Matroids SIAM Journal on Discrete Mathematics	2007-09-06	Paper
Matroid T‐Connectivity SIAM Journal on Discrete Mathematics	2007-09-06	Paper
Towards a matroid-minor structure theory	2007-06-28	Paper
Packing non-zero \(A\)-paths in group-labelled graphs Combinatorica	2007-05-08	Paper
scientific article; zbMATH DE number 5057511 (Why is no real title available?)	2006-09-26	Paper
Obstructions to branch-decomposition of matroids Journal of Combinatorial Theory. Series B	2006-07-12	Paper
On Rota's conjecture and excluded minors containing large projective geometries. Journal of Combinatorial Theory. Series B	2006-05-18	Paper
Bridging Separations in Matroids SIAM Journal on Discrete Mathematics	2005-09-16	Paper
Regular matroid decomposition via signed graphs Journal of Graph Theory	2005-02-16	Paper
Inequivalent representations of matroids having no \(U_{3,6}\)-minor Journal of Combinatorial Theory. Series B	2004-10-01	Paper
A short proof of non-GF(5)-representability of matroids Journal of Combinatorial Theory. Series B	2004-08-06	Paper
Average plane-size in complex-representable matroids (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: Jim Geelen