Bipartite Rigidity

Eran Nevo

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


We develop a bipartite rigidity theory for bipartite graphs parallel to the classical rigidity theory for general graphs. This theory coincides with the study of Babson–Novik’s balanced shifting restricted to graphs. We establish bipartite analogs of the cone, contraction, deletion, and gluing lemmas, and apply these results to derive a bipartite analog of the rigidity criterion for planar graphs. Our result asserts that a bipartite graph is planar only if its balanced shifting does not contain K3, 3. We also discuss potential applications of this theory to Jockusch’s cubical lower bound conjecture and to upper bound conjectures for embedded simplicial complexes.

Original languageEnglish
Title of host publicationCombinatorial Methods in Topology and Algebra
EditorsBruno Benedetti, Emanuele Delucchi, Luca Moci
PublisherSpringer International Publishing
Number of pages8
ISBN (Print)9783319369983
StatePublished - 1 Jan 2015
Externally publishedYes

Publication series

NameSpringer INdAM Series
ISSN (Print)2281-518X
ISSN (Electronic)2281-5198


Dive into the research topics of 'Bipartite Rigidity'. Together they form a unique fingerprint.

Cite this