A note on local colorings of graphs

Andrzej Ruciński, Mirosław Truszczyński

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


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 languageEnglish
Pages (from-to)251-255
Number of pages5
JournalDiscrete Mathematics
Issue number1-3
StatePublished - 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


Dive into the research topics of 'A note on local colorings of graphs'. Together they form a unique fingerprint.

Cite this