11 search results - page 1 / 3 » Intersections of Randomly Embedded Sparse Graphs are Poisson |
COMBINATORICS
1999
13 years 5 months ago
1999
RSA
2011
13 years 6 days ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
COMBINATORICA
2007
13 years 5 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
RSA
2011
13 years 6 days ago
2011
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...