The Dress conjectures on rank in the 3-dimensional rigidity matroid

Bill Jackson, Tibor Jordán

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

A. Dress has made two conjectures concerning the rank function of the 3-dimensional rigidity matroid. The first would give a min-max formula for this rank function and hence a good characterization for independence. We show that the first conjecture is false for all graphs with at least 56 vertices. On the other, hand we show that the second conjecture and a modified form of the first conjecture are true for certain families of graphs of maximum degree at most five.

Original languageEnglish
Pages (from-to)355-367
Number of pages13
JournalAdvances in Applied Mathematics
Volume35
Issue number4
DOIs
Publication statusPublished - Oct 1 2005

ASJC Scopus subject areas

  • Applied Mathematics

Fingerprint Dive into the research topics of 'The Dress conjectures on rank in the 3-dimensional rigidity matroid'. Together they form a unique fingerprint.

  • Cite this