## Abstract

In the Graph Realization Problem (GRP), one is given a graph G, a set of non-negative edge-weights, and an integer d. The goal is to find, if possible, a realization of G in the Euclidian space ℝ^{d}, such that the distance between any two vertices is the assigned edge weight. The problem has many applications in mathematics and computer science, but isNP-hardwhen the dimension d is fixed. Characterizing tractable instances of GRP is a classical problem, first studied by Menger in 1931. We construct two new infinite families of GRP instances which can be solved in polynomial time. Both constructions are based on the blow-up of fixed small graphs with large expanders. Our main tool is the Connelly's condition in Rigidity Theory, combined with an explicit construction and algebraic calculations of the rigidity (stress) matrix. As an application of our results, we describe a general framework to construct uniquely k-colorable graphs. These graphs have the extra property of being uniquely vector k-colorable.We give a deterministic explicit construction of such a family using Cayley expander graphs.

Original language | English |
---|---|

Pages (from-to) | 1051-1071 |

Number of pages | 21 |

Journal | Discrete and Computational Geometry |

Volume | 50 |

Issue number | 4 |

DOIs | |

State | Published - 1 Dec 2013 |

Externally published | Yes |

## Keywords

- Graph colorability
- Graph realization problem
- Rigidity
- Semi-definite programming

## ASJC Scopus subject areas

- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics