65 citations · 268 across the 20 of their papers we have counts for
6 papers · 1 filter
On the metric dimension of Cartesian powers of a graph
Zilin Jiang, Nikita Polyanskii
A set of vertices resolves a graph if every vertex is uniquely determined by its vector of distances to the vertices in . The metric dimension of a graph is the minimum card…
On spectral radii of unraveled balls
Zilin Jiang
Given a graph , the unraveled ball of radius centered at a vertex is the ball of radius centered at in the universal cover of . We prove a lower bound on the…
Ramsey-nice families of graphs
Ron Aharoni, Noga Alon, Michal Amir +5
For a finite family of fixed graphs let be the smallest integer for which every -coloring of the edges of the complete graph yields a…
Forbidden subgraphs for graphs of bounded spectral radius, with applications to equiangular lines
Zilin Jiang, Alexandr Polyanskii
The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Let be the family of connected graphs of spectral radius . We show that $\…
Finding a best approximation pair of points for two polyhedra
Ron Aharoni, Yair Censor, Zilin Jiang
Given two disjoint convex polyhedra, we look for a best approximation pair relative to them, i.e., a pair of points, one in each polyhedron, attaining the minimum distance between…
Proof of László Fejes Tóth's zone conjecture
Zilin Jiang, Alexandr Polyanskii
A zone of width on the unit sphere is the set of points within spherical distance of a given great circle. We show that the total width of any collection of zones coverin…