Probabilistic construction of proportional graphs

Svante Janson; Joel Spencer

doi:10.1002/rsa.3240030203

Probabilistic construction of proportional graphs

Svante Janson, Joel Spencer

Research output: Contribution to journal › Article › peer-review

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 & Algorithms
Volume	3
Issue number	2
DOIs	https://doi.org/10.1002/rsa.3240030203
State	Published - 1992

ASJC Scopus subject areas

Software
General Mathematics
Computer Graphics and Computer-Aided Design
Applied Mathematics

Access to Document

10.1002/rsa.3240030203

Cite this

@article{bb7bcf55583b43faaafd0dc4f2efdf99,

title = "Probabilistic construction of proportional graphs",

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.",

author = "Svante Janson and Joel Spencer",

year = "1992",

doi = "10.1002/rsa.3240030203",

language = "English (US)",

volume = "3",

pages = "127--137",

journal = "Random Structures & Algorithms",

issn = "1042-9832",

publisher = "John Wiley and Sons Ltd",

number = "2",

}

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

SN - 1042-9832

VL - 3

SP - 127

EP - 137

JO - Random Structures & Algorithms

JF - Random Structures & Algorithms

IS - 2

ER -

Probabilistic construction of proportional graphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this