A note on local colorings of graphs

Andrzej Ruciński; Mirosław Truszczyński

doi:10.1016/S0012-365X(96)00058-1

A note on local colorings of graphs

Andrzej Ruciński, Mirosław Truszczyński

Computer Science

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

10 Scopus citations

Abstract

Recently, Rödl and Ruciński [5,6] proved the following threshold result about Ramsey properties of random graphs. Let K(n, p) be the binomial random graph obtained from the complete graph K(n) by independent deletion of each edge with probability 1 - p. We write F → (G)_r if for every r-coloring of the edges of F there is a monochromatic copy of G.

Original language	English
Pages (from-to)	251-255
Number of pages	5
Journal	Discrete Mathematics
Volume	164
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(96)00058-1
State	Published - Feb 10 1997

Bibliographical note

Funding Information:
* Corresponding author. 1 Research supported by KBN grant 210879101.

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/S0012-365X(96)00058-1

Cite this

@article{7cc04957cfe14b01b59d1f559e94aa64,

title = "A note on local colorings of graphs",

abstract = "Recently, R{\"o}dl and Ruci{\'n}ski [5,6] proved the following threshold result about Ramsey properties of random graphs. Let K(n, p) be the binomial random graph obtained from the complete graph K(n) by independent deletion of each edge with probability 1 - p. We write F → (G)r if for every r-coloring of the edges of F there is a monochromatic copy of G.",

author = "Andrzej Ruci{\'n}ski and Miros{\l}aw Truszczy{\'n}ski",

year = "1997",

month = feb,

day = "10",

doi = "10.1016/S0012-365X(96)00058-1",

language = "English",

volume = "164",

pages = "251--255",

number = "1-3",

}

TY - JOUR

T1 - A note on local colorings of graphs

AU - Ruciński, Andrzej

AU - Truszczyński, Mirosław

PY - 1997/2/10

Y1 - 1997/2/10

N2 - Recently, Rödl and Ruciński [5,6] proved the following threshold result about Ramsey properties of random graphs. Let K(n, p) be the binomial random graph obtained from the complete graph K(n) by independent deletion of each edge with probability 1 - p. We write F → (G)r if for every r-coloring of the edges of F there is a monochromatic copy of G.

AB - Recently, Rödl and Ruciński [5,6] proved the following threshold result about Ramsey properties of random graphs. Let K(n, p) be the binomial random graph obtained from the complete graph K(n) by independent deletion of each edge with probability 1 - p. We write F → (G)r if for every r-coloring of the edges of F there is a monochromatic copy of G.

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

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

U2 - 10.1016/S0012-365X(96)00058-1

DO - 10.1016/S0012-365X(96)00058-1

M3 - Article

AN - SCOPUS:0002100268

SN - 0012-365X

VL - 164

SP - 251

EP - 255

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

A note on local colorings of graphs

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this