On Flattenability of Graphs
DOI10.1007/978-3-319-21362-0_9zbMath1439.05166arXiv1503.01489OpenAlexW1520555415MaRDI QIDQ3452282
Joel Willoughby, Sitharam, Meera
Publication date: 11 November 2015
Published in: Automated Deduction in Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.01489
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- Graph minors. XX: Wagner's conjecture
- On bar frameworks, stress matrices and semidefinite programming
- Isometric embedding in \(\ell_ p\)-spaces
- Realizability of graphs in three dimensions
- Finite and infinitesimal rigidity with polyhedral norms
- Minimum dimension embedding of finite metric spaces
- Problems of distance geometry and convex properties of quadratic maps
- Symmetry groups, semidefinite programs, and sums of squares
- Graph rigidity via Euclidean distance matrices
- Characterizing graphs with convex and connected Cayley configuration spaces
- Faces of the cone of Euclidean distance matrices: characterizations, structure and induced geometry
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- The topology of spaces of polygons
- On Khot’s unique games conjecture
- Extensions of Lipschitz mappings into a Hilbert space
- On the impossibility of dimension reduction in l 1
- ON THE CONJECTURE OF KEVIN WALKER
- The cut cone,L1 embeddability, complexity, and multicommodity flows
- The Rigidity of Graphs
- Sum-of-squares proofs and the quest toward optimal algorithms
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
- Rounding Semidefinite Programming Hierarchies via Global Correlation
This page was built for publication: On Flattenability of Graphs