|
Contemporary Mathematics. Fundamental Directions, 2013, Volume 51, Pages 64–73
(Mi cmfd254)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
On large subgraphs with small chromatic numbers contained in distance graphs
A. A. Kokotkin, A. M. Raigorodskii Dolgoprudnyi, Moscow region, Russia
Abstract:
It is proved that each distance graph on a plane has an induced subgraph with a chromatic number that is at most 4 containing over 91 % of the vertices of the original graph. This result is used to obtain the asymptotic growth rate for a threshold probability that a random graph is isomorphic to a certain distance graph on a plane. Several generalizations to larger dimensions are proposed.
Citation:
A. A. Kokotkin, A. M. Raigorodskii, “On large subgraphs with small chromatic numbers contained in distance graphs”, Topology, CMFD, 51, PFUR, M., 2013, 64–73; Journal of Mathematical Sciences, 214:5 (2016), 665–674
Linking options:
https://www.mathnet.ru/eng/cmfd254 https://www.mathnet.ru/eng/cmfd/v51/p64
|
Statistics & downloads: |
Abstract page: | 309 | Full-text PDF : | 103 | References: | 39 |
|