Weakly Saturated Graphs are Rigid

Gil Kalai*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

23 Scopus citations

Abstract

We prove that every embedding of a weakly d-saturated graph G into R4-2, such that the vertices are in the general position, is rigid. This result gives another proof to a conjecture of Bollobás.

Original languageEnglish
Pages (from-to)189-190
Number of pages2
JournalNorth-Holland Mathematics Studies
Volume87
Issue numberC
DOIs
StatePublished - 1 Jan 1984

Fingerprint

Dive into the research topics of 'Weakly Saturated Graphs are Rigid'. Together they form a unique fingerprint.

Cite this