## Annals of Combinatorics 4 (2000) 375-382Random Structures Christian M. Reidys Los Alamos National Laboratory, TSA 2, NM 87545, USA
Received September 14, 1998
X with vertex set {1,...,
n} and (ii) a multi-set of binary relations over the finite set ,
associated with the edges of X. The X-edges are the union
of the edge sets of two random graphs, X_{1} and X_{2}.
X_{1} is a random partial one factor graph over the vertices
and has edge set {y_{1}, ...,y_{m}}.
X
has vertex set {1, ...,n} and is obtained by selecting the edges of _{2}
\ {yK_{n}_{1},...,y_{m}} with independent probability
p={c_{2}
/ n},c_{2}>0. This paper provides a probabilistic
analysis of the contact graphs of random structures and puts the results
into context with the evolutionary optimization of biopolymers.
References
1. N. Alon, J.H. Spensor, and P. Erdös, 2. H. Bauer, 3. B. Bollobás, 4. H. Chennoff, 5. R.M. Karp, 6. C.M. Reidys, 7. C.M. Reidys, P.F. Stadler, and P. Schuster, 8. P. Schuster, W. Fontana, P.F. Stadler, and I.L. Hofacker, 9. M.S. Walterman, |