Abstract
We study the picture space \({\mathcal{X}^d(G)}\) of all embeddings of a finite graph G as point-and-line arrangements in an arbitrary-dimensional projective space, continuing previous work on the planar case. The picture space admits a natural decomposition into smooth quasiprojective subvarieties called cellules, indexed by partitions of the vertex set of G, and the irreducible components of \({\mathcal{X}^d(G)}\) correspond to cellules that are maximal with respect to a partial order on partitions that is in general weaker than refinement. We study both general properties of this partial order and its characterization for specific graphs. Our results include complete combinatorial descriptions of the irreducible components of the picture spaces of complete graphs and complete multipartite graphs, for any ambient dimension d. In addition, we give two graph-theoretic formulas for the minimum ambient dimension in which the directions of edges in an embedding of G are mutually constrained.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brylawski, T., Oxley, J.: The Tutte polynomial and its applications, matroid applications, Encyclopedia Math. Appl., vol. 40, pp. 123–225. Cambridge University Press, Cambridge (1992)
Develin M., Martin J.L., Reiner V.: Rigidity theory for matroids. Comment. Math. Helv. 82(1), 197–233 (2007)
Edmonds J.: Minimum partition of a matroid into independent subsets. J. Res. Nat. Bur. Standards Sect. B 69, 67–72 (1965)
Frank, A.: Connectivity and network flows Handbook of combinatorics, vol. 1, 2, pp. 111–177. Elsevier, Amsterdam (1995).
Graver J., Servatius B., Servatius H.: Combinatorial rigidity, graduate studies in Mathematics, vol. 2. American Mathematical Society, Providence (1993)
Hartshorne R.: Algebraic geometry, graduate texts in Mathematics, vol. 52. Springer, New York (1977)
Laman G.: On graphs and rigidity of plane skeletal structures. J. Eng. Math. 4, 331–340 (1970)
Martin, J.L.: Geometry of graph varieties, Trans. Am. Math. Soc. 355(10), 4151–4169 (2003) (electronic)
Martin J.L.: On the topology of graph picture spaces. Adv. Math. 191(2), 312–338 (2005)
Martin J.L.: The slopes determined by n points in the plane. Duke Math. J. 131(1), 119–165 (2006)
Oxley J.G.: Matroid theory. Oxford Science Publications, The Clarendon Press Oxford University Press, New York (1992)
Servatius B.: On the rigidity of Ramanujan graphs. Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 43(2000), 165–170 (2001)
Stanley R.P.: An introduction to hyperplane arrangements, Geometric combinatorics, IAS/Park City Math. Ser., vol. 13, pp. 389–496. American Mathematical Society, Providence (2007)
Author information
Authors and Affiliations
Corresponding author
Additional information
J. L. Martin’s research is partially supported by an NSA Young Investigators Grant.
T. Enkosky and J. L. Martin are contributed equally to this paper.
Rights and permissions
About this article
Cite this article
Enkosky, T., Martin, J.L. Graph varieties in high dimension. Beitr Algebra Geom 54, 1–12 (2013). https://doi.org/10.1007/s13366-011-0064-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13366-011-0064-4