27 citations · 83 across the 20 of their papers we have counts for
4 papers · 1 filter
Covering by planks and avoiding zeros of polynomials
Alexey Glazyrin, Roman Karasev, Alexandr Polyanskii
We note that the recent polynomial proofs of the spherical and complex plank covering problems by Zhao and Ortega-Moreno give some general information on zeros of real and complex…
Forbidden induced subgraphs for graphs and signed graphs with eigenvalues bounded from below
Zilin Jiang, Alexandr Polyanskii
The smallest eigenvalue of a graph is the smallest eigenvalue of its adjacency matrix. We show that the family of graphs with smallest eigenvalue at least can be defined by a…
Disjoint edges in geometric graphs
Nikita Chernega, Alexandr Polyanskii, Rinat Sadykov
A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a…
Intersecting diametral balls induced by a geometric graph
Olimjoni Pirahmad, Alexandr Polyanskii, Alexey Vasilevskii
For a graph whose vertex set is a finite set of points in the Euclidean -space consider the closed (open) balls with diameters induced by its edges. The graph is called a (an op…