Small subgraphs and their extensions in a random distance graph
Combinatorics
2018-05-09 v1 Probability
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.
Cite
@article{arxiv.1701.06917,
title = {Small subgraphs and their extensions in a random distance graph},
author = {A. V. Burkin and M. E. Zhukovskii},
journal= {arXiv preprint arXiv:1701.06917},
year = {2018}
}
Comments
in Russian