WorksMathematics
Uniquely balanced polyhedral complexes are highly connected
Abstract
We establish higher connectivity of polyhedral complexes admitting a unique positive balanced top cycle. Our main result shows that, after quotienting by common lineality, every skeleton satisfies the corresponding higher connectivity property. The proof bounds the number of connected components surviving facet deletions by the dimension of the top-cycle space using homological and linear-algebraic arguments. As applications, we prove higher connectivity for all skeleta of arbitrary pointed polyhedral structures on tropical linear spaces of valuated matroids and Bergman fans including nonrealizable cases. These results answer questions raised by Maclagan and Yu.
Introduction
The tropicalization of an irreducible algebraic variety is connected through codimension one [9]: any two maximal cells can be joined by a sequence of maximal cells meeting along codimension-one faces. This connectivity underlies algorithms for computing tropical varieties [BJS+07]. [15] strengthens this property by proving higher connectivity: for a -dimensional irreducible variety over a field of characteristic zero, its tropicalization is -connected through codimension one where is the dimension of the lineality space of the chosen polyhedral complex (see [GHM+21] for positive characteristic). This means that connectivity persists after deleting any closed maximal cells. Its significance lies in the use of algebraic geometry methods, notably a tropical Bertini theorem, to establish strong combinatorial consequences from algebraic irreducibility.
[15 Section 5] asks whether tropical irreducibility suffices for higher connectivity. We approach this question through the space of balanced top-dimensional cycles. For a pure -dimensional polyhedral complex , let denote its top-cycle space, defined using the cellular boundary map with coefficients in the top exterior powers of the direction spaces of its facets. We say that is uniquely balanced if it admits a positive top cycle and , as its positive top cycle is unique up to scaling. Our first main result shows that this condition forces higher connectivity, without any rationality assumption.
Theorem 1. Let be a finite pure -dimensional real polyhedral complex admitting a positive top cycle, and suppose . Then, the lineality spaces of all cells of coincide, defining a subspace such that is pointed. For every , its -skeleton is -connected through codimension one. Equivalently, the -skeleton of is -connected through codimension one.
In the usual rational setting of tropical geometry, the uniquely balanced condition is equivalent to tropical irreducibility. Consequently, our theorem establishes higher connectivity for tropically irreducible balanced complexes. The distinction from algebraic irreducibility is essential because an algebraically irreducible variety may not have a tropically irreducible tropicalization. For example, the irreducible curve
has tropicalization where are the tropical coordinates. This tropicalization has two independent balanced top cycles. Conversely, the Bergman fan of the Vámos matroid is uniquely balanced but cannot arise as the tropicalization of an algebraic variety. It illustrates that our work applies beyond the scope of the algebraic irreducibility result (see Example 21).
Whereas [15] uses a tropical Bertini theorem, we prove by filling boundaries on deleted facets and recovering the balancing condition through linear algebra. The key ingredient is Proposition 7 which bounds the number of connected components surviving the deletion of at most facets by the dimension of the top-cycle space. The idea is to construct an independent top cycle from each surviving component by filling the boundary of the restricted positive cycle on the deleted facets. We apply Theorem 1 to tropical linear spaces of valuated matroids and Bergman fans. In particular, we establish higher connectivity for all skeleta of arbitrary pointed polyhedral structures on these spaces, including nonrealizable cases (see Theorem 18 and corollary 19). These results answer the corresponding questions raised in [15 Section 5].
The paper is organized as follows. Section 2 introduces balanced top cycles and their behavior under subdivisions and quotients. Section 3 establishes the bound on surviving connected components using filling arguments. Section 4 proves the connectivity of lower-dimensional skeleta and Theorem 1. Section 5 applies the results to tropical linear spaces and Bergman fans. Section 6 examines coordinate-projection matroids and related examples.
Balanced cycles and polyhedral structures
Throughout, is a finite-dimensional real vector space. A polyhedral complex is a finite collection of closed convex polyhedra satisfying the usual face and intersection conditions. We make no rationality assumption; this allows nonrational subdivisions and quotients by arbitrary real subspaces. For a polyhedral complex , its support is , and denotes the set of its -dimensional cells. If is pure of dimension , its facets and ridges are its cells of dimension and , respectively. Its -skeleton consists of the cells of dimension at most ; if is pointed, it is pure of dimension . The lineality space of a polyhedron is the largest linear subspace with . A polyhedron is pointed if its lineality space is zero, equivalently if it contains no affine line, and a complex is pointed if all its cells are. If a linear subspace lies in the lineality space of every cell of , the images of the cells in form a polyhedral complex with the same face poset.
Definition 1. A hypergraph is connected if any two vertices are joined by a sequence of vertices in which consecutive vertices lie in a common hyperedge; we regard the empty hypergraph as connected. A hypergraph is strongly -vertex-connected if it remains connected after deleting any at most vertices together with every hyperedge containing one of them. The facet-ridge hypergraph of a pure polyhedral complex has the facets of as vertices and, for each ridge , the hyperedge consisting of the facets containing . We say that is -connected through codimension one if its facet-ridge hypergraph is strongly -vertex-connected.
Thus, deleting a facet removes every ridge it contains: a ridge of a deleted facet cannot be used to connect surviving facets, even if two other facets containing it survive. We call this strong deletion.
Let be a pure -dimensional polyhedral complex in . For each cell , let denote its direction space. Fix an orientation for each cell of . When for a lattice , we call rational if it is spanned by vectors in . For a fixed real vector space , the cellular Borel-Moore chains of with coefficients in are
with boundary operator
where the sum is over codimension-one faces of and is the incidence sign.
Remark 2. Unlike ordinary cellular chains, Borel-Moore chains allow unbounded cells. We use the same coefficient space for every cell, so the boundary maps involve only incidence signs, unlike tropical chains whose coefficient spaces depend on the cells [2].
Taking , we restrict the boundary map to the subspace and write
When it is clear from the context, we suppress the and denote it by . We call the top-cycle space of . For each , choose a generator compatible with the chosen orientation of . A cycle is called positive if for every . The positivity of a cycle is independent of the chosen orientations and positive rescalings of . We call uniquely balanced if it admits a positive top cycle and . For rational fans, this agrees with [2 Definition 3.12] since in top degree the tropical Borel-Moore homology there coincides with .
Suppose that for a lattice and that all direction spaces are rational. Choose primitive lattice generators of compatible with the orientations. Then, is the usual balancing condition in at each ridge where is the primitive normal vector of in [2 Definition 3.12 and Example 3.14].
Definition 2. A positive balanced polyhedral support with rational direction spaces is tropically irreducible if it cannot be expressed as the union of two proper positive balanced supports of the same dimension.
To relate tropical irreducibility to the uniquely balanced condition, we show that the top-cycle space is preserved under subdivision and quotient.
Lemma 3. Let be a pure -dimensional polyhedral complex and a subdivision of . Then, there is a natural isomorphism preserving positivity. Moreover, if a real subspace lies in the linearity space of every cell, quotienting gives an isomorphism preserving positivity.
Proof. Suppose that a maximal cell is subdivided into with inherited orientations and the same exterior generator . This is possible since for all . Let be the coefficient of in the cycle. For each , we impose the same exterior coefficients for all . Let be a new interior ridge shared by two subfacets and . Then, we have , and hence . Along the subdivided original ridges, the boundary equations agree with the original ones and hence vanish.
Conversely, let be a cycle on with coefficient on the subfacets of . At any new interior ridge shared by and , the cycle condition gives
and hence . Since the subfacets of are connected through interior ridges, we have . Thus, a subdivision does not induce an independent weight, and the cycle spaces are naturally isomorphic. Since the weights are unchanged, positivity is also preserved.
For the quotient, fix an oriented volume element . The map
identifies the top exterior lines. Note that it is independent of the lift. With product orientations, the boundary equations correspond up to a common sign, so zero boundaries and positivity are preserved. Since every cell is invariant under , quotienting preserves the face and incidence relations.
Lemma 4. For a complex with rational direction spaces admitting a positive balanced rational weighting, tropical irreducibility is equivalent to the space of top-dimensional cycles being one-dimensional, that is, .
Proof. Since the boundary map is represented by a rational matrix, its kernel has a basis over . Let be a positive rational weighting and a rational balanced weighting not proportional to . Let and . Then, we have and and are nonnegative balanced weightings. Each has nonempty proper support and their supports cover . A contradiction to tropical irreducibility.
Conversely, a proper balanced sub-support gives a nonproportional weighting after a common refinement; the subdivision assertion in Lemma 3 identifies it with a weighting on , and hence . This is also the equivalence in [6 Proposition 2.4 (i) and (iii)].
For rational direction spaces, the uniquely balanced condition is also equivalent to strong extremality of balanced weighted complexes in the sense of [7 Definition 2.11].
Filling cycles on deleted facets
Our goal is to bound the number of connected components remaining after deleting facets by the dimension of the top-cycle space. The idea is to construct an independent cycle from each surviving component. Restricting a positive cycle to a surviving component may destroy the balancing condition, but the resulting boundary is supported on the union of the deleted facets. We first show that such boundaries can be “filled”. The bound of deleted facets arises from two complementary constraints: one topological and the other geometric.
Lemma 5. Let be pointed closed convex polyhedra, . For any finite-dimensional real vector space ,
for .
Proof. We first consider a single convex polyhedron. A bounded nonempty convex polyhedron is contractible, so its Borel-Moore homology vanishes in positive degrees. We show that an unbounded pointed polyhedron has zero Borel-Moore homology in every degree. To show this, choose strictly positive on , and larger than its values at all vertices. The hyperplane cuts off the unbounded parts without removing any vertices. Then, and are nonempty compact convex polyhedra. The cellular Borel-Moore chain complex of is isomorphic to the relative cellular chain complex of since the faces of correspond to the truncated faces not contained in . Because both and are contractible, their relative homology vanishes. The same argument applies to any finite subdivision by choosing above all its vertices.
We now induct on . Let . The cellular Mayer-Vietoris sequence for contains
For , both and vanish by the induction hypothesis and the base case, respectively. Moreover, is a union of at most pointed convex polyhedra, after discarding empty intersections. Thus, its -th Borel-Moore homology vanishes by induction. The result follows. □
In our situation, if is the union of at most deleted -dimensional facets, then by Lemma 5. Hence, for any -cycle on with coefficients in , there exists a -chain supported on such that . However, when , such a filling need not have coefficients in the lines required by (1). The following lemma rules this out.
Lemma 6. Let be a pure pointed -dimensional polyhedral complex with , and let consist of at most facets. Each has two ridges with distinct direction hyperplanes, neither contained in another member of .
Proof. Fix . At a vertex of , which exists as is pointed, choose incident ridges whose normal covectors in are linearly independent. Another deleted facet can contain at most one of these ridges since its intersection with is a proper face of .
There are at most other deleted facets. Hence, at least two of the selected ridges are not contained in any other member of . Their direction hyperplanes are distinct by construction. □
These two lemmas yield the following bound.
Proposition 7. Let be a finite pure pointed -dimensional real polyhedral complex admitting a positive top cycle. After strong deletion of at most facets, the number of nonempty components of its surviving facet-ridge hypergraph is at most .
Proof. Fix a positive top cycle with . If no facets are deleted, the restriction of to each facet-ridge component is already a cycle. These cycles are linearly independent, proving the claim. This also covers .
Let be a nonempty collection of at most deleted facets, and let be their union, including all faces. For each surviving component , define the chain . This may not be a cycle because restricting to may destroy the balancing equations.
However, at every ridge outside , all incident facets survive and belong to the same component. Thus, the original balancing equation still holds there. Hence, is supported on . Since , it is a -cycle on with constant coefficients .
By Lemma 5, . Therefore, there exists a filling with such that .
We show that the filling coefficients satisfy . Fix and choose the two ridges as in Lemma 6. At either ridge, is the only deleted facet contributing to . On the other hand, every contribution to at that ridge belongs to . Since , we obtain
The two direction hyperplanes are distinct in . Choosing a basis adapted to both hyperplanes shows that
Thus, every coefficient of belongs to the required top exterior line.
Hence, is a top cycle since . Since is supported only on deleted facets, agrees with the original positive cycle on and vanishes on every other surviving component. If , then comparison of coefficients on any facet gives . Since , we have for every . Hence, these cycles are linearly independent. We conclude the proof. □
The following example shows that the bound in Proposition 7 is sharp and illustrates how the boundary created by restricting a cycle to a surviving component can be filled using the deleted facet.
Example 8. For linearly independent , let be the fan whose rays are generated by and whose facets are the cones on every pair of these rays. Set , and (see Figure 1). The two fans meet exactly in and its faces. Each fan is a linear image of the standard tropical plane. Normalize its positive cycle to have exterior coefficient on , and take . Thus, the coefficient of on is . Strong deletion of leaves precisely two components and . With orientations chosen so that , we have and . The top-cycle space has dimension exactly two: the balancing equations at the two nonshared rays of each plane force its five surviving facet coefficients to be proportional to those of . After subtracting these two multiples, any remaining cycle is supported on alone and hence is zero. Thus, the bound in Proposition 7 is attained.
Lemma 5 also gives a lower bound on the number of facets supporting a nonzero top cycle.

Figure 1. Constructing a top cycle from a surviving component in Proposition 7. Vertices represent rays and edges represent two-dimensional facets. The dashed edge represents the deleted facet . (a) Deleting separates the two components. (b) Restricting the original cycle to one component creates boundary coefficients and . (c) Adding cancels this boundary and completes the cycle.
Lemma 9. A pointed pure -dimensional complex admitting a nonzero top cycle has at least facets.
Proof. If there were facets, Lemma 5 would give . But a nonzero top cycle represents a nonzero homology class since there are no -cells. □
To the skeleta
We show how connectivity through codimension one descends to lower-dimensional skeleta. Related higher-connectivity results for skeleta of arbitrary convex polytopes were studied in [4, 12, 16]. The main difficulty is that deleting a lower-dimensional cell may remove either a vertex or a hyperedge from the facet-ridge hypergraph of a higher-dimensional cell. The following lemma shows that either deletion drops strong vertex connectivity by at most one.
Lemma 10. Let be a strongly -vertex-connected hypergraph with at least vertices for . Then, is strongly -vertex-connected for every hyperedge . Consequently, deleting vertices strongly and then hyperedges leaves connected whenever .
Proof. Fix a hyperedge of . First, we delete at most vertices and call the resulting hypergraph . has at least three vertices and remains connected even after one additional strong vertex deletion. If was removed by the vertex deletions, then which is connected. Otherwise, if were disconnected, would meet every component because is connected. Choose so that at least two components of remain nonempty after removing : when there are two components, choose in one with at least two vertices, and when there are at least three components, any choice works. Strong deletion of also deletes , contradicting connectivity of . Iterating this observation after the first vertex deletions proves the claim. □
:::
We next apply this observation to the facet-ridge graphs of pointed polyhedra.
Lemma 11. Let be a pointed polyhedron of dimension . Its facet-ridge hypergraph is -connected and has at least vertices.
Proof. Homogenize to a pointed cone in one higher dimension and cut by a strictly positive affine section. The resulting compact -polytope has a distinguished face at height zero, possibly empty. Faces of not contained in correspond to the faces of by projective transformation.
The facet-ridge graph of is the vertex-edge graph of its polar, hence is -connected by Balinski’s theorem [5]. The ridges of contained in are not faces of , and every other ridge lies in exactly two facets of , so the facet-ridge hypergraph of is a graph. Hence, if , passing to deletes one vertex and its incident edges from the facet-ridge graph of . If , passing to deletes one edge. If its dimension is smaller, or is bounded, it deletes neither vertices nor edges. Lemma 10 proves -connectivity. A -polytope has at least facets, and at most one is lost, proving the second claim.
We can descend from the connectivity of a polyhedral complex to that of its lower-dimensional skeleta.
Proposition 12. Let be a finite pure pointed -dimensional polyhedral complex with at least facets. If is -connected through codimension one, then its -skeleton is -connected through codimension one for every .
Proof. Use descending induction, assuming the -skeleton is -connected. Delete at most closed -cells, denoted . In the facet-ridge hypergraph of the -skeleton, these -cells are hyperedges. Deleting them preserves connectivity by Lemma 10. This hypergraph has at least vertices: when , this is assumed; for , we apply Lemma 11 to any -cell.
To turn this connectivity of -cells into connectivity of their -dimensional faces, we need to connect surviving -faces within each -cell. Fix such a -cell . By Lemma 11, its facet-ridge graph is -connected and has at least vertices. For each , the intersection is a single proper face or is empty. If it has dimension , it deletes one graph vertex and its incident edges in the facet-ridge graph. If it has dimension , it deletes one edge. A smaller intersection deletes neither. Thus, as we deleted at most -cells, at most vertex or edge deletions occur. By Lemma 10, the surviving -faces of remain connected through allowed -faces.
Given two surviving -cells and , choose -cells and containing and , respectively. Because is pure, such cells exist. By connectivity of the -skeleton after the hyperedge deletions, and can be joined by a sequence of -cells, with consecutive cells sharing a surviving -cell (see Figure 2). Within each successive -cell along this sequence, connect the incoming and outgoing -faces using the local connectivity established above. Concatenating these paths gives a path between the original two -cells. This also works for , when there are no deletions, and proves the induction.

Figure 2. Schematic illustration of the proof of Proposition 12. Connectivity of the -skeleton gives a path where consecutive cells share surviving -faces . Within each , local facet-ridge connectivity provides a path between the relevant -faces. Concatenating these paths connects to in the -skeleton.
We now combine the connectivity bound of Proposition 7 with the descent result of Proposition 12. When the top-cycle space is one-dimensional, the resulting connectivity extends to every skeleton after quotienting by the common linearity space.
Proof of Theorem 1. Restricting a positive top cycle to each facet-ridge component gives a nonzero top cycle since all facets incident to a ridge belong to the same component. These cycles have disjoint supports, and so they are linearly independent. Since , there can be only one component. A nonempty face of a polyhedron has the same lineality as that polyhedron. Hence, facets sharing a ridge have the same lineality space. Then, connectivity through codimension one and purity imply that all cells of share a common lineality space . By Lemma 3, the pointed quotient has a positive top cycle and a one-dimensional top-cycle space. Apply Propositions 7 and 12 and lemma 9 in dimension . When , the connectivity assertion is vacuous. □
For complexes with rational direction spaces, unique balancing is equivalent to tropical irreducibility by Lemma 4. Thus, we obtain the following consequence.
Corollary 13. A finite pure tropically irreducible balanced complex of dimension , with common lineality of dimension , is -connected through codimension one. Its -skeleton is -connected through codimension one for .
Proof. Apply Lemma 4 and theorem 1. □
The general theorem also applies to arbitrary pointed polyhedral subdivisions of .
Corollary 14. Let be a finite pointed polyhedral complex with support . For every , its -skeleton is -connected through codimension one.
Proof. The complex is pure of dimension , and every facet has direction space . Hence, . The fundamental cycle induced by an orientation of is positive. Since is pointed, Theorem 1 applies with
Applied to the normal fan of a -polytope , whose -skeleton has the -faces of as facets and the -faces as ridges, Corollary 14 recovers [12 Theorem 1.1], and hence [15 Corollary 2]. It also covers non-polytopal complete fans and pointed subdivisions of that are not fans.
Tropical linear spaces and Bergman fans
Theorem 1 requires the global condition that , involving balancing equations across all facets and ridges. However, it can be obtained locally when the balancing relations at individual ridges are unique and the complex is connected through codimension one. The following proposition makes this observation precise.
Proposition 15. Let be a finite pure -dimensional complex with a positive top cycle
For each ridge , define a linear map
with . Thus, consists of the weightings balanced at . Suppose for every ridge. Then, equals the number of facet-ridge components of . In particular, if is connected through codimension one, then , and the conclusions of Theorem 1 hold.
Proof. Let be a top cycle. At a ridge , both and the strictly positive vector belong to . Hence, has the same value for all facets containing . These ratios are constant on each facet-ridge component.
Conversely, restricting to any such component gives a top cycle because all facets incident to any ridge belong to the same component. These restrictions have disjoint facet supports and form a basis of .
Remark 16. Under the assumptions of Proposition 15, the existence of a positive top cycle and the condition imply that the transverse star
is linearly isomorphic to the image of the standard tropical line in where denotes the number of facets containing . More precisely, after rescaling by the positive balancing coefficients, the vectors are the images of the standard basis vectors of under an injective linear map from to . Note that this linear isomorphism may not preserve the integral lattice, so the ridge condition does not imply tropical smoothness.
We apply this criterion to tropical linear spaces of valuated matroids (see [14 Section 4.4] or [17], for example). Their local geometry is governed by initial matroids, which allows us to verify the ridge condition explicitly. Let be a valuated matroid of rank on with loopless underlying matroid . For , write , and let be the matroid whose bases maximize . The associated tropical linear space is
which is pure of dimension . The Bergman fan of a matroid is the tropical linear space associated with the trivial valuation. For its combinatorial structure, see [1, 10].
For , write . Let denote the number of connected components of , and set
Thus, .
For a polyhedral support and , write
The coarse subdivision of consists of the closures of the loci on which is constant. Its cells are defined by comparisons of the basis scores .
Lemma 17. Let be a valuated matroid of rank with a loopless underlying matroid. Then, every finite pure -dimensional polyhedral complex with support admits a positive top cycle, and .
Proof. We first claim that we have for every . To see this, for any fixed and sufficiently small , the bases maximizing
are precisely those that maximize among the bases of . Thus, , which gives the claim.
Let be a cell of the coarse subdivision and . A vector belongs to precisely when for all bases of . These vectors are exactly those constant on each connected component of . Hence, is the lineality space of , and .
Let be a ridge of the coarse subdivision and . Then, , so has exactly one component of rank two, and all other components have rank one. Let be the parallel classes of . Since is connected, .
Near , the facets containing correspond to the rays generated by modulo . These satisfy , and any of them are linearly independent modulo . Hence, this is their unique linear relation up to scaling. Moreover, the vectors give the primitive normal vectors in the quotient lattice. Consequently, choosing the primitive lattice generators , the cycle with all coefficients one is balanced at every ridge, and at every ridge.
Tropical linear spaces are connected through codimension one [3 Corollary 1.6]. By Proposition 15, the top-cycle space is spanned by the weight-one cycle. Finally, Lemma 3 transfers this to any finite polyhedral complex with support through a common refinement.
We verify that lies in the lineality space of every cell of the coarse subdivision. Indeed, any two bases of have the same cardinality in each connected component of . Thus, translation by a vector in adds the same constant to every basis score , leaving the initial matroid unchanged. Consequently, every cell is invariant under translation by .
Theorem 18. Let be a linear subspace of and let be any pointed polyhedral complex with support . For every , the -skeleton of is -connected through codimension one.
Proof. By Lemma 17, the coarse subdivision of admits a positive top cycle and has a one-dimensional top cycle space. Since , quotienting by preserves these properties by Lemma 3. Then, a finite common refinement of the resulting quotient complex and transfers the same properties to . Since is pointed and has dimension , the conclusion follows from Theorem 1.
Corollary 19. Let be a loopless matroid of rank on , and let be the lineality space of . Let and let be a pointed fan with support . Put . Then, its -skeleton is -connected through codimension one for every . In particular, the coarse subdivision in and every finer fan structure have -connected facet-ridge hypergraphs whenever . For connected of rank at least two, the coarse fan in is -connected.
Proof. Apply Theorem 18 to the trivial valuation. □
Connectivity and coordinate-projection matroids
For a balanced complex with support , let where is the coordinate projection. If is the tropicalization of an irreducible variety, then is the collection of independent sets of its algebraic matroid [Yu17]. The following examples show that higher connectivity does not force to be a matroid, and that tropical irreducibility, even together with higher connectivity, does not force it to be algebraic.
Example 20. Let and with each plane subdivided into its four coordinate quadrants. Since each plane is balanced, this pointed fan is balanced with all weights one. It is 2-connected through codimension one. In fact, after one quadrant is deleted, the other three quadrants of its plane remain connected, every other plane loses at most one boundary ray and remains connected, and consecutive planes still share a ray of their common axis. However, the two-element sets in are exactly , and . Thus, cannot be augmented from , and is not a matroid. This fan is not tropically irreducible because each plane carries its own balanced weighting.
Example 21. Let be the Vámos matroid, a connected rank-four matroid on eight elements that is not algebraic over any field [13], and let . By Lemmas 4 and 17, is tropically irreducible, and by Corollary 19, every pointed fan structure on is 3-connected through codimension one. However, is the collection of independent sets of [Yu17, Lemma 3], which is not algebraic. In particular, is not the tropicalization of any irreducible variety.
We do not know whether always defines a matroid when is tropically irreducible.
Acknowledgments
We thank Josephine Yu for suggesting this problem when [15] first appeared, and Cvetelina Hill for discussions at an early stage of this project. Department of Mathematical Sciences, Korea Advanced Institute of Science and Technology
Email address: [email protected]
References
- [1]F. Ardila and C. J. Klivans. The Bergman complex of a matroid and phylogenetic trees. Journal of Combinatorial Theory, Series B, 96(1):38–49, 2006.DOI
- [2]E. Aksnes. Tropical Poincaré duality spaces. Advances in Geometry, 23(3):345–370, 2023.
- [3]N. Anderson. Matroid products in tropical geometry. Research in the Mathematical Sciences, 11(2):38, 2024.arxiv.org/abs/2306.14771
- [4]C. A. Athanasiadis. On the graph connectivity of skeleta of convex polytopes. Discrete & Computational Geometry, 42(2):155–165, 2009.arxiv.org/abs/0801.0939
- [5]M. L. Balinski. On the graph structure of convex polyhedra in n-space. Pacific Journal of Mathematics, 11(2):431–434, 1961.
- [6]F. Babaee, S. Dewar, and J. Maxwell. Extremal decompositions of tropical varieties and relations with rigidity theory. Journal of Symbolic Computation, 132:102461, 2026.
- [7]F. Babaee and J. Huh. A tropical approach to a generalized Hodge conjecture for positive currents. Duke Mathematical Journal, 166(14):2749 – 2813, 2017.DOI
- [9]D. Cartwright and S. Payne. Connectivity of tropicalizations. Mathematical Research Letters, 19(5):1089–1095, 2013.DOI
- [10]E. M. Feichtner and B. Sturmfels. Matroid polytopes, nested sets and Bergman fans. Portugaliae Mathematica, 62(4):437–468, 2005.
- [12]D. Hathcock and J. Yu. On the hypergraph connectivity of skeleta of polytopes. Discrete & Computational Geometry, 69(2):593–596, 2023.arxiv.org/abs/2010.05053
- [13]A. W. Ingleton and R. A. Main. Non-algebraic matroids exist. Bulletin of the London Mathematical Society, 7(2):144–146, 1975.DOI
- [14]D. Maclagan and B. Sturmfels. Introduction to tropical geometry, volume 161. American Mathematical Society, Providence, RI, 2015.
- [15]D. Maclagan and J. Yu. Higher connectivity of tropicalizations. Mathematische Annalen, 384:775–788, 2022.arxiv.org/abs/1908.05988
- [16]G. T. Sallee. Incidence graphs of convex polytopes. Journal of Combinatorial Theory, 2(4):466–506, 1967.DOI
- [17]D. E. Speyer. Tropical linear spaces. SIAM Journal on Discrete Mathematics, 22(4):1527–1558, 2008.DOI