The d-dimensional rigidity matroid of sparse graphs

Bill Jackson, T. Jordán

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

Let Rd (G) be the d-dimensional rigidity matroid for a graph G = (V, E). For X ⊆ V let i (X) be the number of edges in the subgraph of G induced by X. We derive a min-max formula which determines the rank function in Rd (G) when G has maximum degree at most d + 2 and minimum degree at most d + 1. We also show that if d is even and i (X) ≤ 1/2 [(d + 2) X - (2d + 2)] for all X ⊆ V with X ≥ 2 then E is independent in Rd (G). We conjecture that the latter result holds for all d ≥ 2 and prove this for the special case when d = 3. We use the independence result for even d to show that if the connectivity of G is sufficiently large in comparison to d then E has large rank in Rd (G). We use the case d = 4 to show that, if G is 10-connected, then G can be made rigid in ℝ3 by pinning down approximately three quarters of its vertices.

Original languageEnglish
Pages (from-to)118-133
Number of pages16
JournalJournal of Combinatorial Theory. Series B
Volume95
Issue number1
DOIs
Publication statusPublished - Sep 2005

Fingerprint

Sparse Graphs
Matroid
Rigidity
Independence Results
Minimum Degree
Min-max
Maximum Degree
Subgraph
Connectivity
Graph in graph theory

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

The d-dimensional rigidity matroid of sparse graphs. / Jackson, Bill; Jordán, T.

In: Journal of Combinatorial Theory. Series B, Vol. 95, No. 1, 09.2005, p. 118-133.

Research output: Contribution to journalArticle

@article{ed0aaa146c944aeeb631660579c1197d,
title = "The d-dimensional rigidity matroid of sparse graphs",
abstract = "Let Rd (G) be the d-dimensional rigidity matroid for a graph G = (V, E). For X ⊆ V let i (X) be the number of edges in the subgraph of G induced by X. We derive a min-max formula which determines the rank function in Rd (G) when G has maximum degree at most d + 2 and minimum degree at most d + 1. We also show that if d is even and i (X) ≤ 1/2 [(d + 2) X - (2d + 2)] for all X ⊆ V with X ≥ 2 then E is independent in Rd (G). We conjecture that the latter result holds for all d ≥ 2 and prove this for the special case when d = 3. We use the independence result for even d to show that if the connectivity of G is sufficiently large in comparison to d then E has large rank in Rd (G). We use the case d = 4 to show that, if G is 10-connected, then G can be made rigid in ℝ3 by pinning down approximately three quarters of its vertices.",
author = "Bill Jackson and T. Jord{\'a}n",
year = "2005",
month = "9",
doi = "10.1016/j.jctb.2005.03.004",
language = "English",
volume = "95",
pages = "118--133",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - The d-dimensional rigidity matroid of sparse graphs

AU - Jackson, Bill

AU - Jordán, T.

PY - 2005/9

Y1 - 2005/9

N2 - Let Rd (G) be the d-dimensional rigidity matroid for a graph G = (V, E). For X ⊆ V let i (X) be the number of edges in the subgraph of G induced by X. We derive a min-max formula which determines the rank function in Rd (G) when G has maximum degree at most d + 2 and minimum degree at most d + 1. We also show that if d is even and i (X) ≤ 1/2 [(d + 2) X - (2d + 2)] for all X ⊆ V with X ≥ 2 then E is independent in Rd (G). We conjecture that the latter result holds for all d ≥ 2 and prove this for the special case when d = 3. We use the independence result for even d to show that if the connectivity of G is sufficiently large in comparison to d then E has large rank in Rd (G). We use the case d = 4 to show that, if G is 10-connected, then G can be made rigid in ℝ3 by pinning down approximately three quarters of its vertices.

AB - Let Rd (G) be the d-dimensional rigidity matroid for a graph G = (V, E). For X ⊆ V let i (X) be the number of edges in the subgraph of G induced by X. We derive a min-max formula which determines the rank function in Rd (G) when G has maximum degree at most d + 2 and minimum degree at most d + 1. We also show that if d is even and i (X) ≤ 1/2 [(d + 2) X - (2d + 2)] for all X ⊆ V with X ≥ 2 then E is independent in Rd (G). We conjecture that the latter result holds for all d ≥ 2 and prove this for the special case when d = 3. We use the independence result for even d to show that if the connectivity of G is sufficiently large in comparison to d then E has large rank in Rd (G). We use the case d = 4 to show that, if G is 10-connected, then G can be made rigid in ℝ3 by pinning down approximately three quarters of its vertices.

UR - http://www.scopus.com/inward/record.url?scp=23244468113&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=23244468113&partnerID=8YFLogxK

U2 - 10.1016/j.jctb.2005.03.004

DO - 10.1016/j.jctb.2005.03.004

M3 - Article

AN - SCOPUS:23244468113

VL - 95

SP - 118

EP - 133

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 1

ER -