1542 search results - page 35 / 309 » The metamathematics of random graphs |
RSA
2006
14 years 9 months ago
2006
We study the question as to when a random graph with n vertices and m edges contains a copy of almost all graphs with n vertices and cn/2 edges, c
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
JCB
2006
14 years 9 months ago
2006
We study the probability distribution of genomic distance d under the hypothesis of random gene order. We translate the random order assumption into a stochastic method for constr...
EJC
2006
14 years 9 months ago
2006
An n-lift of a graph K, is a graph with vertex set V (K)
JCT
2010
14 years 4 months ago
2010
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...