Benedict Randall Shaw

activity

20242026

most citedCompletely independent spanning trees in the hypercube

1 citations · 1 across the 7 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

math.CO2024★ 1 cited

Completely independent spanning trees in the hypercube

Benedict Randall Shaw

We say two spanning trees of a graph are completely independent if their edge sets are disjoint, and for each pair of vertices, the paths between them in each spanning tree do not…

math.CO2024

Reconstructing almost all of a point set in $R^{d}$ from randomly revealed pairwise distances

Douglas Barnes, Jan Petr, Julien Portier +2

Let $V$ be a set of $n$ points in $R^{d}$ , and suppose that the distance between each pair of points is revealed independently with probability $p$ . We study when this infor…

Completely independent spanning trees in the hypercube

Reconstructing almost all of a point set in Rd from randomly revealed pairwise distances

Reconstructing almost all of a point set in $R^{d}$ from randomly revealed pairwise distances