|
On the Realization of Subgraphs of a Random Graph by Diameter Graphs in Euclidean Spaces
A. A. Kokotkina, A. M. Raigorodskiiab a Moscow Institute of Physics and Technology (State University), Dolgoprudny, Moscow region
b Lomonosov Moscow State University
Abstract:
The present paper is motivated by Borsuk's classical problem of the partition of sets in spaces into parts of smaller diameter. We obtain sharp estimates for the maximal number of vertices of the induced subgraph of a random graph that, with high probability, is isomorphic to the diameter graph with given chromatic number in a space of any fixed dimension.
Keywords:
random graph, diameter graph, Euclidean space, Borsuk problem, chromatic number, independence number.
Received: 25.05.2014 Revised: 26.10.2014
Citation:
A. A. Kokotkin, A. M. Raigorodskii, “On the Realization of Subgraphs of a Random Graph by Diameter Graphs in Euclidean Spaces”, Mat. Zametki, 97:5 (2015), 699–717; Math. Notes, 97:5 (2015), 709–724
Linking options:
https://www.mathnet.ru/eng/mzm10559https://doi.org/10.4213/mzm10559 https://www.mathnet.ru/eng/mzm/v97/i5/p699
|
|