On Density-Critical Matroids
Rutger Campbell, Kevin Grace, James Oxley, and Geoff Whittle

TL;DR
This paper characterizes density-critical matroids, identifies ten minimal obstructions for covering by two independent sets, and explores the structure of such matroids, especially those with density less than 2.
Contribution
It provides a complete classification of certain density-critical matroids and explicitly solves the case for density at most 9/4.
Findings
Ten minimal obstructions for covering by two independent sets.
Density-critical matroids with density less than 2 are series-parallel networks.
Solved the classification problem for density at most 9/4.
Abstract
For a matroid having rank-one flats, the density is unless , in which case . A matroid is density-critical if all of its proper minors of non-zero rank have lower density. By a 1965 theorem of Edmonds, a matroid that is minor-minimal among simple matroids that cannot be covered by independent sets is density-critical. It is straightforward to show that is the only minor-minimal loopless matroid with no covering by independent sets. We prove that there are exactly ten minor-minimal simple obstructions to a matroid being able to be covered by two independent sets. These ten matroids are precisely the density-critical matroids such that but for all proper minors of . All density-critical matroids of density less than are series-parallel networks. For , although finding all…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
On density-critical matroids
Rutger Campbell
Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada
,
Kevin Grace
School of Mathematics, University of Bristol, Bristol, UK
,
James Oxley
Department of Mathematics, Louisiana State University, Baton Rouge, Louisiana, USA
and
Geoff Whittle
School of Mathematics, Statistics and Operations Research, Victoria University of Wellington, Wellington, New Zealand
Abstract.
For a matroid having rank-one flats, the density is unless , in which case . A matroid is density-critical if all of its proper minors of non-zero rank have lower density. By a 1965 theorem of Edmonds, a matroid that is minor-minimal among simple matroids that cannot be covered by independent sets is density-critical. It is straightforward to show that is the only minor-minimal loopless matroid with no covering by independent sets. We prove that there are exactly ten minor-minimal simple obstructions to a matroid being able to be covered by two independent sets. These ten matroids are precisely the density-critical matroids such that but for all proper minors of . All density-critical matroids of density less than are series-parallel networks. For , although finding all density-critical matroids of density at most does not seem straightforward, we do solve this problem for .
1991 Mathematics Subject Classification:
05B35
1. Introduction
Our notation and terminology follow Oxley [7]. For a positive integer , let be the class of matroids for which is the union of independent sets. We say such a matroid can be covered by independent sets. Edmonds [3] gave the following characterization of the members of .
Theorem 1.1**.**
A matroid has independent sets whose union is if and only if, for every subset of ,
[TABLE]
Clearly, is closed under deletion. However, is not closed under contraction. For example, the -element rank- uniform matroid can be covered by two independent sets, yet contracting a point of this matroid gives , which cannot. For all , the loop is the unique minor-minimal matroid not in . On that account, we limit the types of obstructions we consider. We first examine the minor-minimal loopless matroids that are not in . We find the following result.
Proposition 1.2**.**
The unique minor-minimal loopless matroid that cannot be covered by independent sets is .
Restricting attention to minor-minimal simple matroids not in , we find much more structure. We have the following collection of ten matroids for the case when is two. In this result, denotes the parallel connection of matroids and , this matroid being unique when both and have transitive automorphism groups. Geometric representations of the nine of these ten matroids of rank at most four are shown in Figure 1. A diagram representing the tenth matroid, is also given where we note that this matroid has rank five.
Theorem 1.3**.**
The minor-minimal simple matroids that cannot be covered by two independent sets are , , , , , , , , , and .
The following consequence of Theorem 1.1 will be helpful.
Lemma 1.4**.**
Let be a minor-minimal matroid that cannot be covered by independent sets. Then
[TABLE]
Moreover, has no coloops.
For a matroid , we write for , the number of rank-one flats of . The density of is unless . In the exceptional case, and we define . We say that is density-critical when for all proper minors of . Note that all density-critical matroids are simple. By Lemma 1.4 and Theorem 1.1, is a minor-minimal simple matroid that cannot be covered by independent sets if and only if but for all proper minors of . Such matroids are strictly -density-critical where, for , we say a matroid is strictly -density-critical when its density is strictly greater than while all its proper minors have density at most . Thus Theorem 1.3 explicitly determines all ten strictly -density-critical matroids.
We propose the following.
Conjecture 1.5**.**
For all positive integers , there are finitely many minor-minimal simple matroids that cannot be covered by independent sets.
More generally, we make the following conjectures. For , we say a matroid is -density-critical when its density is at least while all of its proper minors have density strictly less than .
Conjecture 1.6**.**
For all , there are finitely many strictly -density-critical matroids.
Conjecture 1.7**.**
For all , there are finitely many -density-critical matroids.
We also propose the following weakening of the last conjecture.
Conjecture 1.8**.**
For all , there are finitely many density-critical matroids with density exactly .
We note that these conjectures hold over any class of matroids that is well-quasi-ordered with respect to minors. In particular, by a result announced by Geelen, Gerards, and Whittle (see, for example, [4]), these conjectures hold within the class of matroids representable over a fixed finite field.
Because the two excluded minors for series-parallel networks, and , have density exactly two, for , all density-critical matroids of density at most are series-parallel networks. For , finding all density-critical matroids of density at most does not seem straightforward. However, we were able to solve this problem when . For all , we denote by any matroid that can be constructed from copies of via a sequence of parallel connections. In particular, . There are two choices for depending on which element of is used as the basepoint of the parallel connection with the third copy of . We denote by the -element matroid that is obtained by attaching, via parallel connection, a copy of at each element of an .
Theorem 1.9**.**
*The following is a list of all pairs where is a density-critical matroid of density and :
, , for all , , , , , , , .*
2. Preliminaries
This section proves some preliminary results beginning with two that were stated in the introduction.
Proof of Proposition 1.2..
Clearly, is a minor-minimal loopless matroid that cannot be covered by independent sets. Conversely, suppose that is a minor-minimal loopless matroid that cannot be covered by independent sets. Certainly, contains some element . Let be the parallel class of that contains where and . Now is loopless, so, by minimality, can be covered by independent sets . Note that each is independent in , so if , then is a set of independent sets that covers . Thus , and so . ∎
Since is a -element cocircuit, the matroids having no -minor are precisely the matroids for which every cocircuit has at most elements.
Proof of Lemma 1.4..
Take in . Then can be covered by independent sets. Thus, by Theorem 1.1,
[TABLE]
We deduce that and so has no coloops. ∎
Lemma 2.1**.**
Let be a density-critical matroid of rank at least two. For each subset of ,
[TABLE]
In particular, every element of is in a triangle and is in at least two triangles when .
Proof.
Since is density-critical and therefore simple,
[TABLE]
Hence , so
[TABLE]
Thus . In particular, for all in . Hence every such element is in at least one triangle, and is in at least two triangles when . ∎
The next result will be useful in the proof of Theorem 1.3.
Lemma 2.2**.**
In a -connected matroid , let be a -element set . Suppose is independent and is a circuit for all , where . Then is a wheel of rank at least three or a whirl of rank at least two.
Proof.
Since is -connected with at least four elements, it is simple. Now has as a triad, where . By a result of Seymour [8] (see also [7, Lemma 8.8.5(ii)]), is a wheel or a whirl of rank . ∎
3. The matroids that cannot be covered by two independent sets
In this section, we prove Theorem 1.3 thereby specifying all of the minor-minimal simple matroids that cannot be covered by two independent sets.
Proof of Theorem 1.3..
It is straightforward to check that each of the matroids listed is a minor-minimal simple matroid that cannot be covered by two independent sets. Now let be such a matroid. The next two assertions are immediate consequences of Lemmas 1.4, 2.1, and 1.1. However, we include proofs independent of Edmonds’s result for completeness.
3.1.1**.**
Every element of is contained in at least two triangles.
Let be an element of and let . By minimality, has a partition into two independent sets and . Suppose is not in a triangle. Then and we have and , so is covered by the independent sets and , which is a contradiction.
Now suppose is in exactly one triangle of . We may assume that and that . Then and , so is covered by the independent sets and . This contradiction implies that 3.1.1 holds.
3.1.2**.**
* and for every proper subset of .*
Suppose is a proper subset of . By the minimality of , we can cover by two independent sets, and so . It follows easily that . Thus 3.1.2 holds.
We construct a simple auxiliary graph from , the vertices of which are the elements of ; two such vertices are adjacent exactly when they share a triangle in . Next, we show the following.
3.1.3**.**
Let be the vertex set of a component of . Then has a wheel or a whirl as a restriction.
We may assume that has no line with four or more points otherwise has a rank- whirl as a restriction. For in , by 3.1.1, we can construct a maximal sequence of distinct elements such that is independent and is a triangle for all in . Then .
Now has a triangles and that differ from and , respectively. Let . Assume that both and avoid . Then . Thus, by 3.1.2, . By symmetry, . Hence , so is a -point line, a contradiction.
We may now assume that is a member of for some with . Then is an independent set in such that every two consecutive elements in the given cyclic order are in a triangle. Thus, by Lemma 2.2, has a wheel or whirl of rank as a restriction. Hence 3.1.3 holds.
3.1.4**.**
For some component of having vertex set , the matroid is not a wheel or a whirl.
Assume that this fails. Then, by 3.1.1, the only components of are rank- whirls or rank- wheels. Assume there are of the former and of the latter. Then . Clearly . By 3.1.2, equality must hold here. Hence each component of corresponds to a wheel or whirl component of . As each wheel and each whirl can be covered by two independent sets, so too can , a contradiction. Thus 3.1.4 holds.
Now take a component of having vertex set such that is not a wheel or a whirl. By 3.1.3, consider a wheel or whirl restriction of with basis and ground set . Let be a triangle for all where . As , there is a point in that is contained in a triangle that is not a triangle of . If is a rank- whirl or a rank- wheel, then, by symmetry, we may assume that . If, instead, is neither a rank- whirl nor a rank- wheel, then 3.1.1 guarantees that such a triangle exists with . By repeatedly using 3.1.1, we can construct a sequence where is a triangle for all in and is dependent but is independent. By potentially interchanging and , we may assume that . Let . Then
[TABLE]
As , we deduce, by 3.1.2, that
[TABLE]
Hence
[TABLE]
Assume that the theorem fails. We now show that
3.1.5**.**
* has no wheel-restriction of rank exceeding three and no whirl-restriction of rank exceeding two.*
Assume that this fails. Then we may assume that is a wheel of rank at least four or a whirl of rank at least three. Now and . By (1) and submodularity, . Assume does not span . Then, by (1) and (2), we see that and the only possible elements of that can lie in triangles with elements of are and . But a wheel of rank at least four and a whirl of rank at least three have at least three elements that are in unique triangles. Hence one of these elements will violate 3.1.1.
We now know that spans , so the unique element of is . Each of must be in a triangle with , the other element of which is in . Assume both and are triangles. Then . Suppose is also a triangle. Then, by Lemma 2.2, for each in , deleting from gives a wheel or whirl of rank four. As and are circuits, both of these deletions are wheels. It follows that , so , a contradiction. Thus, we may assume that is not a triangle. Since , there is no triangle containing , a contradiction.
We may now assume that is not a triangle. Then, by 3.1.1, has distinct elements and such that and are triangles. Thus contains a circuit. Now is not in a triangle of . Moreover, if is a triangle, then . Using the triangles, and , we deduce that , a contradiction. It follows that is a circuit of . Thus is either a rank- whirl or a rank- wheel.
Suppose is a rank- whirl. Then is an extension of this matroid by in which every element is in at least two triangles. If or is a triangle, then one easily checks that or , a contradiction. Hence we may assume that none of , , or is a triangle. Then, to avoid having as a minor of , we must have , , and as triangles, that is, , a contradiction.
We are left with the possibility that is a rank- wheel. Since it has as a circuit, it follows that . Then has either and as triangles or and as triangles. By symmetry, we may assume that we are in the second case. Then, by submodularity using the sets and , we deduce that . It follows that , a contradiction. We conclude that 3.1.5 holds.
Now suppose that spans . If is a rank- whirl, then , a contradiction. If is a rank- wheel, then one easily checks that is isomorphic to one of , , or , a contradiction.
We may now assume that does not span . Then . By (3), . We will first suppose that for some in . Then is an independent set and is a triangle for all in . By 3.1.5 and Lemma 2.2, for , the matroid is a rank- wheel or a rank- whirl. Then the matroid obtained from by contracting and simplifying is the parallel connection of and , that is, has as a minor one of , , and , a contradiction.
Finally, suppose that . Then is for some , or . Consider the first case and take . Then, by 3.1.5 and Lemma 2.2, with , we have that is a rank-3 wheel or a rank-2 whirl. Contracting from and simplifying, we obtain one of , , and , a contradiction. In the second case, when , we recall that . Suppose that is not in a triangle of . Then and . By assumption, is independent. By Lemma 2.2, the triangles , , imply that has a wheel or whirl of rank at least four as a restriction, a contradiction. We deduce that is in a triangle of . Then, by symmetry, we may assume that . We let . Then, for , we have that is a rank-3 wheel or a rank-2 whirl. But , so is a rank-3 wheel. If is a rank- whirl, then is a restriction of , a contradiction. If is a rank- wheel, then has rank four and consists of two copies of sharing a triangle. This matroid is , a contradiction. ∎
4. The density-critical matroids of small density
In this section, we prove Theorem 1.9. The following result [6] (see also [7, Lemma 4.3.10]) will be used repeatedly in this proof.
Lemma 4.1**.**
Let be a connected matroid having at least two elements and let be a cocircuit of such that is disconnected for all in . Then contains a -circuit of .
We shall make repeated use of the following consequence of this lemma.
Corollary 4.2**.**
Let be a simple connected matroid and be a non-empty non-spanning subset of . Then has a simple connected minor N such that and .
Proof.
Let be a cocircuit of that is disjoint from . As is simple, it follows by Lemma 4.1 that there is an element of such that is connected. Since , we see that . Clearly we can label so that its ground set contains . If , then we take . Otherwise we repeat the above process using in place of . After applications of this process, we obtain the desired minor . ∎
The next result, which was proved by Dirac [2], follows easily by induction after recalling that a connected matroid with no minor isomorphic to or is isomorphic to the cycle matroid of a series-parallel network.
Lemma 4.3**.**
Let be a simple matroid having no minor isomorphic to or . Then
[TABLE]
We omit the elementary proof of the next result a consequence of which is that every density-critical matroid is connected.
Lemma 4.4**.**
Let and be matroids of rank at least one. Then
[TABLE]
Moreover, equality holds here if and only if .
The next result will be useful in identifying the density-critical matroids of density at most two.
Lemma 4.5**.**
Let be a density-critical matroid with . If is a -separation of , then there is an element in , and .
Proof.
As is a -separation of , for some element not in , we can write as where each has ground set . Let and . Assume that both and are simple. Then , so
[TABLE]
Hence
[TABLE]
By symmetry,
[TABLE]
Adding the last two inequalities gives so for some . Thus . Since is density-critical with density at most two, this is a contradiction. We conclude that or , say , is non-simple. Thus it has an element in parallel with the basepoint of the -sum. Hence . ∎
Lemma 4.6**.**
Let be a simple connected matroid in which all but at most one element is in at least two triangles. Then has no -cocircuits. Moreover, if has as a triad, then either
- (i)
* is contained in a -point line and ; or*
- (ii)
* has a triangle such that and is the generalized parallel connection of and across the triangle .*
Proof.
As has at most one element that is not in at least two triangles, has no -cocircuits. Suppose is a triad of . If is also a triangle, then is -separating in . Moreover, is contained in a -point line and (i) holds.
We may now assume that is not a triad of . Then, because at least two of and are in at least two triangles, the hyperplane of contains distinct elements , , and such that , , and are triangles. Now
[TABLE]
Thus is a triangle of and . It follows by a result of Brylawski [1] (see also [7, Proposition 11.4.15]) that (ii) holds. ∎
Corollary 4.7**.**
Let be a simple connected matroid in which all but at most one element is in at least two triangles and . If , then . If , then . If , then , or .
Proof.
We omit the straightforward proof for the case when . Assume . By Lemma 4.6, has no -cocircuits. Now suppose has as a triad. If (i) of Lemma 4.6 holds, then . By the result in the rank- case, , so . If, instead, (ii) of Lemma 4.6 holds, then is the generalized parallel connection across a triangle of and . In the latter, must be a triad of , so . Hence is the generalized parallel connection across a triangle of two copies of , so .
We may now assume that has no triads. Then every cocircuit of has at least four elements. As certainly has a plane that contains two intersecting triangles, and , we deduce that , so . Let be the cocircuit . Because has no plane with more than five points and has all but at most one element in two triangles, we may assume that and are triangles of . Then has as triangles. By Lemma 2.2, is a rank- wheel or whirl. In this matroid, , , , and are in unique triangles. It follows that must have and as triangles. Thus is a rank- wheel. Likewise, and are also rank- wheels, so . ∎
Lemma 4.8**.**
Let be a simple matroid of rank at least three in which every element is in at least two triangles. Suppose . Then
- (i)
* is in a plane of having at least seven points; or*
- (ii)
every element of is in at least two triangles; or
- (iii)
* has a - or -restriction using .*
Proof.
Assume that neither (i) nor (iii) holds. We show that every element of is in at least two triangles. First consider a triangle of containing . Let and be triangles of where neither contains . If , then, in , the element corresponding to and is in at least two triangles. Now suppose . Since has no plane with more than six points, we may assume that . Rename this element . If is not a triangle, then has a -point line containing , so is in at least two triangles of this matroid. If is a triangle of , then , a contradiction.
Now let be an element of that is not in a triangle with . Let and be triangles of . Then has at least two triangles containing otherwise , a contradiction. ∎
Recall that is the -element matroid that is obtained by attaching, via parallel connection, a copy of at each element of an .
Lemma 4.9**.**
Let be a simple connected non-empty matroid in which every element is in a - or -restriction. Assume that but for all proper minors of . Then is isomorphic to , or .
Proof.
Since for all minors of , we see that, in any such , no line has more than four points and no plane has more than six points. Next we show the following.
4.9.1**.**
If has a -point line, then is isomorphic to or .
This is immediate if . Because has no plane with more than six points, . Let be a -point line of and let be a subset of not containing such that is isomorphic to or . If , then again, since has no plane with more than six points, we deduce that . We may now assume that . If , then has a rank- or rank- restriction of density exceeding , a contradiction. We deduce that .
By Corollary 4.2, has a simple connected minor such that and . As is connected, it has an element that is not in the closure of or of . Then has and as restrictions and has rank . Thus has either a plane with more than six points or has as a restriction. Each possibility yields a contradiction, so 4.9.1 holds.
We may now assume that every element of is in an -restriction. We may also assume that is not isomorphic to or . Next we show the following.
4.9.2**.**
Let and be distinct subsets of such that both and are isomorphic to . If , then .
Since has no plane with more than six points, . As , it follows by submodularity that and . As , we deduce that , so and . Moreover, and meet in a triangle . By Lemma 4.6, is the generalized parallel connection of and across . Thus as each of and is isomorphic to , so 4.9.2 holds.
We may now assume that has at least three distinct subsets with and that no two such subsets meet in more than one element.
4.9.3**.**
* does not have as a restriction.*
Assume that and where . Suppose where . Then and , so
[TABLE]
Simplifying we obtain the contradiction that . We deduce using 4.9.2 that . Then otherwise .
By Corollary 4.2, has a simple connected minor such that and . As is disconnected, must contain an element that is not in . Hence , so . Thus and , so has a single element that is not in . The -restriction of that contains is forced to have more than one element in common with or one of the -restrictions of . This contradiction to 4.9.2 completes the proof of 4.9.3.
We now know that any two -restrictions of have disjoint ground sets. Let , , and be distinct subsets of such that each of , , and is isomorphic to . Next we show the following.
4.9.4**.**
. Moreover, unless .
As and , we deduce that . The density constraint also means that . Suppose . Then , so . Now . As , we must have some parallel elements in . As is skew to each of and , we know that and . Thus there must be elements of and of that are parallel in . If there is a second such parallel pair, then , a contradiction. In , we see that . Hence, in , we obtain a -point plane unless is a triangle of for some in . Observe that each of , , and is disconnected, so is obtained from by attaching a copy of via parallel connection at each element. Thus and 4.9.4 holds.
By Corollary 4.2, has a simple connected minor of rank such that . As is connected, there is an element of . Since has no plane with more than six points, is not in the closure of any of , , or in . As has rank but has density less than , the eighteen elements of cannot all be in distinct parallel classes of . Thus has a triangle where we may assume that and . Since has as a component, there is an element of that is in neither nor . As above, has a triangle where and . Contracting and from and simplifying, we get a rank- matroid with elements. As , we have a contradiction that completes the proof of Lemma 4.9. ∎
Lemma 4.10**.**
Let be a simple connected matroid having an element such that each of and has every element in at least two triangles. If and for all proper minors of , then is isomorphic to , , or .
Proof.
We argue by induction on , which must be at least three. Suppose it is exactly three. Since has density less than , it is isomorphic to . As , we see that . By Lemma 4.6, has no -cocircuits. Thus has a triangle whose complement is a triad. By Lemma 4.6 again, and we get a contradiction. Hence . If , then, by Corollary 4.7, is isomorphic to , or .
Now assume the result holds for and let . Let . Every element of is in at least two triangles. Let be a component of . By Lemma 4.8, either every element of is in a - or -restriction, or has an element such that every element of is in at least two triangles. If the latter occurs, then, by the induction assumption, is isomorphic to , or . Each of these matroids has density , a contradiction. Thus every element of is in a - or -restriction. As , Lemma 4.9 implies that , and hence each component of , is isomorphic to one of , , or .
Suppose that . Then, as , we deduce that . As , we see that . Because , it follows that . Since is in at least two triangles of , we deduce that , a contradiction.
We may now assume that has more than one component. Hence, for some , there is a collection of connected matroids such that for all , the matroid is connected for all , and is the parallel connection of across the common basepoint . As noted above, each is isomorphic to one of , , or . As every element of is in at least two triangles, every element of each except possibly is in at least two triangles of . Thus, by Corollary 4.7, ; or and ; or . In the first case, ; in the second case, . Both of these possibilities give contradictions, so for each . As is in at least two triangles of , we may assume the elements of two such triangles lie in . As and , we see that and . But , a contradiction. ∎
We conclude the paper by proving Theorem 1.9. In this proof, we will make extensive use of the Cunningham-Edmonds canonical tree decomposition of a connected matroid. The definition and properties of this decomposition may be found in [7, Section 8.3]. In brief, associated with each connected matroid , there is a tree that is unique up to the labelling of its edges. Each vertex of is labelled by a circuit, a cocircuit, or a -connected matroid with at least four elements. Moreover, no two adjacent vertices of are labelled by circuits and no two adjacent vertices are labelled by cocircuits. For an edge of whose endpoints are labelled by matroids and , the ground sets of these two matroids meet in . When we contract from , the composite vertex that results by identifying the endpoints of is labelled by the -sum of and . By repeating this process, contracting all of the remaining edges of one by one, we eventually obtain a single-vertex tree. Its vertex is labelled by .
Each edge of induces a partition of . This partition is a -separation of displayed by . The remaining -separations of coincide with those that are displayed by those vertices of that are labelled by circuits or cocircuits. For such a vertex having label , there is a partition of induced by the components of . A partition of is displayed by the vertex if each is contained in or . Every such partition of with both and having at least two elements is a -separation of and these -separations along with those displayed by the edges of are all of the -separations of . Recall that, for all , we denote by any matroid that can be constructed from copies of via a sequence of parallel connections.
Proof of Theorem 1.9..
Let be a density-critical matroid with . Suppose . By Lemma 2.1, every element of is in at least two triangles. By Corollary 4.7, if , then is or . We may now assume that . By Lemma 4.8, either every element of is in a - or -restriction, or, for some element of , every element of is in at least two triangles. In the first case, by Lemma 4.9, is isomorphic to , or . In the second case, by Lemma 4.10, is isomorphic to , or . Thus the theorem identifies all possible density-critical matroids with density in and one easily checks that each of the matroids identified is indeed density-critical.
Now suppose that . By Lemma 4.4, is connected. Clearly, if is or , then is isomorphic to or . As and both have density , is a series-parallel network (see, for example, [7, Corollary 12.2.14]). Thus, in the Cunningham-Edmonds canonical tree decomposition of , every vertex is labelled by a circuit or a cocircuit. Since is simple, for every vertex of that is labelled by a cocircuit , at most one element of is in . Let be an edge of that meets the vertex labelled by . Then, for the -separation of that is displayed by , Lemma 4.5 implies that has an element in . Thus , so contains exactly one element of .
Now take a vertex of that is labelled by a circuit where and suppose that . Suppose . Then is simple having rank . As we obtain the contradiction that . We deduce that . Now has exactly three components. Let be the one containing and let be the subset of corresponding to . Then is a -separation of . By Lemma 4.5, there is an element of that is in . But the tree decomposition implies that there is no such element. We deduce that has exactly three elements. Thus every vertex of that is labelled by a circuit is labelled by a triangle. Since every vertex of that is labelled by a cocircuit has exactly one element of in that cocircuit, a straightforward induction argument establishes that, for some , the matroid is obtained from copies of by a sequence of parallel connections. Thus .
Finally, we show by induction that is density-critical. This is true for . Assume it true for and let . Take in . Assume first that is in exactly one triangle . Then . As the last matroid is easily seen to be isomorphic to the density-critical matroid and , we deduce that every minor of has density less that . Now assume that is in at least two triangles of . Then is easily seen to be the direct sum of a collection of matroids each of which is isomorphic to some with . By Lemma 4.4 and the induction assumption, every minor of has density less that . We conclude that is density-critical, so the theorem is proved. ∎
Acknowledgements
The work for this paper was done at the Tutte Centenary Retreat (https://www.matrix-inst.org.au/events/tutte-centenary-retreat/) held at the MAThematical Research Institute (MATRIx), Creswick, Victoria, Australia, 26 November – 2 December, 2017. The authors are very grateful for the support provided by MATRIx. The first, second, and fourth authors were supported, respectively, by NSERC Scholarship PGSD3-489418-2016, National Science Foundation Grant 1500343, and the New Zealand Marsden Fund.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] T.H. Brylawski, Modular constructions for combinatorial geometries, Trans. Amer. Math. Soc. 203 (1975), 1–44.
- 2[2] G.A. Dirac, In Abstrakten Graphen vorhande vollständige 4 4 4 -Graphen und ihre Unterteilungen, Math. Nach. 22 (1960), 61–85.
- 3[3] J. Edmonds, Minimum partition of a matroid into independent sets, J. Res. Nat. Bur. Standards Sect. B 69B (1965), 67–72.
- 4[4] J. Geelen, B. Gerards, G. Whittle, Solving Rota’s Conjecture, Notices Amer. Math. Soc. 61 (2014), 736–743.
- 5[5] D.W. Hall, A note on primitive skew curves, Bull. Amer. Math. Soc. 49 (1943), 935–937.
- 6[6] J.G. Oxley, On connectivity in matroids and graphs, Trans. Amer. Math. Soc. 265 (1981), 47–58.
- 7[7] J. Oxley, Matroid Theory, Second edition, Oxford Univ. Press, New York, 2011.
- 8[8] P.D. Seymour, Decomposition of regular matroids, J. Combin. Theory Ser. B 28 (1980), 305–359.
