On a method for random graphs

Zbigniew Palka, Andrzej Rucinśki, Joel Spencer

Research output: Contribution to journalArticle

Abstract

In this paper we examine a method for establishing an almost sure existence of a subgraph of a random graph with a given subgraph property. Since the method has been abused in the literature, we state some conditions under which it can be safely used. As an illustration we apply the method to induced cycles, maximal induced trees and arbitrary subgraphs of a random graph Kn,p.

Original languageEnglish (US)
Pages (from-to)253-258
Number of pages6
JournalDiscrete Mathematics
Volume61
Issue number2-3
DOIs
StatePublished - 1986

Fingerprint

Random Graphs
Subgraph
Cycle
Arbitrary

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

On a method for random graphs. / Palka, Zbigniew; Rucinśki, Andrzej; Spencer, Joel.

In: Discrete Mathematics, Vol. 61, No. 2-3, 1986, p. 253-258.

Research output: Contribution to journalArticle

Palka, Zbigniew ; Rucinśki, Andrzej ; Spencer, Joel. / On a method for random graphs. In: Discrete Mathematics. 1986 ; Vol. 61, No. 2-3. pp. 253-258.
@article{ebdd5bd8cb1443ca903a98fda215f817,
title = "On a method for random graphs",
abstract = "In this paper we examine a method for establishing an almost sure existence of a subgraph of a random graph with a given subgraph property. Since the method has been abused in the literature, we state some conditions under which it can be safely used. As an illustration we apply the method to induced cycles, maximal induced trees and arbitrary subgraphs of a random graph Kn,p.",
author = "Zbigniew Palka and Andrzej Rucinśki and Joel Spencer",
year = "1986",
doi = "10.1016/0012-365X(86)90096-8",
language = "English (US)",
volume = "61",
pages = "253--258",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "2-3",

}

TY - JOUR

T1 - On a method for random graphs

AU - Palka, Zbigniew

AU - Rucinśki, Andrzej

AU - Spencer, Joel

PY - 1986

Y1 - 1986

N2 - In this paper we examine a method for establishing an almost sure existence of a subgraph of a random graph with a given subgraph property. Since the method has been abused in the literature, we state some conditions under which it can be safely used. As an illustration we apply the method to induced cycles, maximal induced trees and arbitrary subgraphs of a random graph Kn,p.

AB - In this paper we examine a method for establishing an almost sure existence of a subgraph of a random graph with a given subgraph property. Since the method has been abused in the literature, we state some conditions under which it can be safely used. As an illustration we apply the method to induced cycles, maximal induced trees and arbitrary subgraphs of a random graph Kn,p.

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

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

U2 - 10.1016/0012-365X(86)90096-8

DO - 10.1016/0012-365X(86)90096-8

M3 - Article

VL - 61

SP - 253

EP - 258

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 2-3

ER -