### Abstract

Proportional graphs are constructed for any rational p ϵ (0, 1) by a probabilistic method: it is shown that a certain random graph may with positive probability be adjusted so as to become proportional. The construction uses a novel type of random graph, where the number of edges is fixed but, nevertheless, the edges appear independently in rather large sets of possible edges.

Original language | English (US) |
---|---|

Pages (from-to) | 127-137 |

Number of pages | 11 |

Journal | Random Structures and Algorithms |

Volume | 3 |

Issue number | 2 |

DOIs | |

State | Published - 1992 |

### Fingerprint

### ASJC Scopus subject areas

- Software
- Mathematics(all)
- Computer Graphics and Computer-Aided Design
- Applied Mathematics

### Cite this

*Random Structures and Algorithms*,

*3*(2), 127-137. https://doi.org/10.1002/rsa.3240030203

**Probabilistic construction of proportional graphs.** / Janson, Svante; Spencer, Joel.

Research output: Contribution to journal › Article

*Random Structures and Algorithms*, vol. 3, no. 2, pp. 127-137. https://doi.org/10.1002/rsa.3240030203

}

TY - JOUR

T1 - Probabilistic construction of proportional graphs

AU - Janson, Svante

AU - Spencer, Joel

PY - 1992

Y1 - 1992

N2 - Proportional graphs are constructed for any rational p ϵ (0, 1) by a probabilistic method: it is shown that a certain random graph may with positive probability be adjusted so as to become proportional. The construction uses a novel type of random graph, where the number of edges is fixed but, nevertheless, the edges appear independently in rather large sets of possible edges.

AB - Proportional graphs are constructed for any rational p ϵ (0, 1) by a probabilistic method: it is shown that a certain random graph may with positive probability be adjusted so as to become proportional. The construction uses a novel type of random graph, where the number of edges is fixed but, nevertheless, the edges appear independently in rather large sets of possible edges.

UR - http://www.scopus.com/inward/record.url?scp=84990669514&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84990669514&partnerID=8YFLogxK

U2 - 10.1002/rsa.3240030203

DO - 10.1002/rsa.3240030203

M3 - Article

AN - SCOPUS:84990669514

VL - 3

SP - 127

EP - 137

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

SN - 1042-9832

IS - 2

ER -