Bipartite rigidity
From MaRDI portal
Publication:2790703
DOI10.1090/tran/6512zbMath1332.05040arXiv1312.0209OpenAlexW4250673247MaRDI QIDQ2790703
Eran Nevo, Isabella Novik, Gil Kalai
Publication date: 8 March 2016
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.0209
Planar graphs; geometric and topological aspects of graph theory (05C10) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Embeddings and immersions in PL-topology (57Q35) Combinatorial aspects of simplicial complexes (05E45)
Related Items
Bar-and-joint rigidity on the moment curve coincides with cofactor rigidity on a conic, Unique low rank completability of partially filled matrices, Completion of tree metrics and rank 2 matrices, Bipartite minors, Maximal matroids in weak order posets, Stable sets in flag spheres, The Colin de Verdière parameter, excluded minors, and the spectral radius, Stable sets in flag spheres, Typical and generic ranks in matrix completion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rigidity and the lower bound theorem. I
- Projectivities in simplicial complexes and colorings of simple polytopes
- Obstructions to the imbedding of a complex in a euclidean space. I: The first obstruction
- Bipartite minors
- On embeddability and stresses of graphs
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions
- Hyperconnectivity of graphs
- A matroid on hypergraphs, with applications in scene analysis and geometry
- The number of faces of a simplicial convex polytope
- The rigidity of graphs. II
- The lower and upper bound problems for cubical polytopes
- A counterexample to the rigidity conjecture for polyhedra
- Gaps in the numbers of vertices of cubical polytopes. I
- Sachs' linkless embedding conjecture
- Van Kampen's embedding obstruction is incomplete for 2-complexes in \(\mathbb{R}^ 4\)
- Counting faces of cubical spheres modulo two
- Reverse lexicographic and lexicographic shifting
- Homomorphiesätze für Graphen
- The numbers of faces of simplicial polytopes
- On graphs and rigidity of plane skeletal structures
- Face numbers and nongeneric initial ideals
- Über eine Eigenschaft der ebenen Komplexe
- Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
- Higher minors and van Kampen's obstruction
- The Rigidity of Graphs
- Even Triangulations of S 3 and the Coloring of Graphs
- Balanced Cohen-Macaulay Complexes
- Embedding products of graphs into Euclidean spaces
- A Combinatorial Analogue of Poincaré's Duality Theorem
- Minors in random and expanding hypergraphs
- Higher-Dimensional analogs of the four-color problem and some inequalities for simplicial complexes
- Approximating Embeddings of Polyhedra In Codimension Three
- Komplexe in euklidischen Räumen
