Kevin Grace 0001

dblp:199/3344 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
1since 2021 · last 2021
0000-0002-6445-0866ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 2 first-author · 1 since 2021
YearPublicationVenuePosition
2021 On the Highly Connected Dyadic, Near-Regular, and Sixth-Root-of-Unity Matroids
abstract
Subject to announced results by Geelen, Gerards, and Whittle [ Towards a structure theory for matrices and matroids, in Proceedings of the International Congress of Mathematicians, Vol. III, 2006, pp. 827--842], we completely characterize the highly connected members of the classes of dyadic, near-regular, and sixth-root-of-unity matroids.
Ben Clark, Kevin Grace 0001, James G. Oxley, Stefan H. M. van Zwam
SIAM J. Discret. Math.2
2019 On a Generalization of Spikes
abstract
We consider matroids with the property that every subset of the ground set of size $t$ is contained in both an $\ell$-element circuit and an $\ell$-element cocircuit; we say that such a matroid has the $(t,\ell)$-property. We show that for any positive integer $t$, there is a finite number of matroids with the $(t,\ell)$-property for $\ell<2t$; however, matroids with the $(t,2t)$-property form an infinite family. We say a matroid is a $t$-spike if there is a partition of the ground set into pairs such that the union of any $t$ pairs is a circuit and a cocircuit. Our main result is that if a sufficiently large matroid has the $(t,2t)$-property, then it is a $t$-spike. Finally, we present some properties of $t$-spikes.
Nick Brettell, Rutger Campbell, Deborah Chun, Kevin Grace 0001, Geoff Whittle
SIAM J. Discret. Math.4
2019 The Highly Connected Even-Cycle and Even-Cut Matroids
abstract
The classes of even-cycle matroids, even-cycle matroids with a blocking pair, and even-cut matroids each have hundreds of excluded minors. We show that the number of excluded minors for these classes can be drastically reduced if we consider in each class only the highly connected matroids of sufficient size.
Kevin Grace 0001, Stefan H. M. van Zwam
SIAM J. Discret. Math.1
2017 Templates for Binary Matroids
abstract
A binary frame template is a device for creating binary matroids from graphic or cographic matroids. Such matroids are said to conform or coconform to the template. We introduce a preorder on these templates and determine the nontrivial templates that are minimal with respect to this order. As an application of our main result, we determine the eventual growth rates of certain minor-closed classes of binary matroids, including the class of binary matroids with no minor isomorphic to $PG(3,2)$. Our main result applies to all highly connected matroids in a class, not just those of maximum size. As a second application, we characterize the highly connected 1-flowing matroids.
Kevin Grace 0001, Stefan H. M. van Zwam
SIAM J. Discret. Math.1