Independence numbers and chromatic numbers of the random subgraphs of some distance graphs

Abstract

This work is concerned with the Nelson-Hadwiger classical problem of finding the chromatic numbers of distance graphs in . Most consideration is given to the class of graphs defined as follows: where is the Euclidean inner product. In particular, the chromatic number of was recently found by Balogh, Kostochka and Raigorodskii. The objects of the study are the random subgraphs whose edges are independently taken from the set , each with probability . The independence number and the chromatic number of such graphs are estimated both from below and from above. In the case when is a prime power and , the order of growth of and is established. Bibliography: 51 titles.