Tree components in random distance graphs of special form
- 31 Downloads
In this work, we consider the problem of distribution of the number of tree components with given number of vertices k(k ≥ 2) for a certain series of random distance graphs. Generalizations of the classical Erdős–Rényi results are obtained in the case of geometric graphs of special form.
KeywordsRandom Graph Tree Component Chromatic Number Induction Assumption Distinguished Vertex
Unable to display preview. Download preview PDF.
- 1.N. Alon and J. Spencer, The Probabilistic Method [Russian translation], Binom, Moscow (2007).Google Scholar
- 3.P. Erdős and A. Rényi, “On random graphs, 1,” Publ. Math. Debrecen, 6, 290–297 (1959); Magyar Tud. Akad. Mat. Kutató Int. Közl., 5, 17–61 (1960).Google Scholar
- 4.P. Erdős and A. Rényi, “On the evolution of random graphs,” Publ. Math. Inst. Hungar. Acad. Sci, 5, 17–61 (1960).Google Scholar
- 6.W. Feller, An Introduction to Probability Theory and Its Applications [Russian translation], Mir, Moscow (1964).Google Scholar
- 7.V. F. Kolchin, Random Graphs [in Russian], Fizmatlit, Moscow (2004).Google Scholar
- 8.A. M. Raigorodskii, Methods of Linear Algebra in Combinatorics [in Russian], Moscow (2007).Google Scholar
- 10.A. R. Yarmukhamrtov, “On the connectedness of random distance graphs of special form,” Chebysh. Sb. (2010).Google Scholar