Work

$K_{5,5}$ is fully reconstructible in $\mathbb{C}^3$

Year: 2021

Type: preprint

Abstract: A graph $G$ is fully reconstructible in $\mathbb{C}^d$ if the graph is determined from its $d$-dimensional measurement variety. The full reconstructibility problem has been solved for $d=1$ and $d=2$. For $d=3$, some necessary and some sufficient conditions are known and $K_{5,5}$ falls squarely within the gap in the theory. In this paper, we show that $K_{5,5}$ is fully reconstructible in $\mathbb{C}^3$.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2110.10224

Authors: Bernstein, Daniel Irving, Gortler, Steven J.

Language: English

Topic: Graph theory and applications

Subfield: Geometry and Topology

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funder: National Science Foundation

Awards: FRG: Collaborative Research: Stability of Structures Large and Small, PostDoctoral Research Fellowship

OpenAlex ID: W3206512511

Cites: 6

Cited by:

Related to: 19