On Large Subgraphs with Small Chromatic Numbers Contained in Distance Graphs

被引:0
|
作者
Kokotkin A. [1 ]
Raigorodskii A. [1 ]
机构
[1] Moscow Institute of Physics and Technology, Moscow
关键词
Random Graph; Chromatic Number; Probabilistic Result; Threshold Probability; Distance Graph;
D O I
10.1007/s10958-016-2804-3
中图分类号
学科分类号
摘要
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. © 2016, Springer Science+Business Media New York.
引用
收藏
页码:665 / 674
页数:9
相关论文
共 50 条