Small subgraphs and their extensions in a random distance graph
arXiv:1701.06917 · doi:10.1070/SM8674
Abstract
In previous papers, threshold probabilities for the properties of a random distance graph to contain strictly balanced graphs were found. We extend this result to arbitrary graphs and prove that the number of copies of a strictly balanced graph has asymptotically Poisson distribution at the threshold.
in Russian