15 citations · 149 across the 60 of their papers we have counts for
5 papers · 1 filter
New bounds for the distance Ramsey number
Andrey Kupavskii, Andrei Raigorodskii, Maria Titova
In this paper we study the distance Ramsey number . The \textit{distance Ramsey number} is the minimum number such that for any graph $ G…
Distance graphs with large chromatic number and arbitrary girth
Andrey Kupavskii
In this article we consider a problem related to two famous combinatorial topics. One of them concerns the chromatic number of the space. The other deals with graphs having big gir…
Two notions of unit distance graphs
Noga Alon, Andrey Kupavskii
A {\em faithful (unit) distance graph} in is a graph whose set of vertices is a finite subset of the -dimensional Euclidean space, where two vertices are adjacent…
Diameter graphs in
Andrey Kupavskii
A \textit{diameter graph in } is a graph, whose set of vertices is a finite subset of and whose set of edges is formed by pairs of vertices that are at d…
The distribution of second degrees in the Buckley-Osthus random graph model
Andrey Kupavskii, Liudmila Ostroumova, Dmitriy Shabanov +1
In this paper we consider a well-known generalization of the Barabási and Albert preferential attachment model - the Buckley-Osthus model. Buckley and Osthus proved that in this mo…