Probabilistic construction of proportional graphs

Svante Janson, Joel Spencer

Research output: Contribution to journalArticle

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 languageEnglish (US)
Pages (from-to)127-137
Number of pages11
JournalRandom Structures and Algorithms
Volume3
Issue number2
DOIs
StatePublished - 1992

Fingerprint

Random Graphs
Directly proportional
Probabilistic Methods
Graph in graph theory
Large Set

ASJC Scopus subject areas

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

Cite this

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

In: Random Structures and Algorithms, Vol. 3, No. 2, 1992, p. 127-137.

Research output: Contribution to journalArticle

@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 and 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

VL - 3

SP - 127

EP - 137

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

SN - 1042-9832

IS - 2

ER -