This is a preview. Log in through your library . Abstract Let HG(x, y) be the expected hitting time from vertex x to vertex y for the first time on a simple connected graph G and φ(G) = ...
Geometric intersection graphs form an intriguing class of structures in which vertices represent geometric objects – such as line segments, discs, or curves – and an edge is established between two ...
Probabilistic methods have been used to approach many problems of Ramsey theory. In this paper we study Ramsey type questions from the point of view of random structures. Let K(n, N) be the random ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results