Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs

P. Erdős, G. Chen, C. C. Rousseau, R. H. Schelp

Research output: Article

15 Citations (Scopus)

Abstract

We consider monochromatic subragraphs in two-colored graphs as guaranteed by Ramsey's theorem, and ask various questions concerning the degree in the two-colored complete graphs of vertices which are part of these subgraphs.

Original languageEnglish
Pages (from-to)183-189
Number of pages7
JournalEuropean Journal of Combinatorics
Volume14
Issue number3
DOIs
Publication statusPublished - máj. 1993

Fingerprint

Edge-colored Graph
Colored Graph
Complete Graph
Subgraph
Ramsey's Theorem

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs. / Erdős, P.; Chen, G.; Rousseau, C. C.; Schelp, R. H.

In: European Journal of Combinatorics, Vol. 14, No. 3, 05.1993, p. 183-189.

Research output: Article

@article{14b9d4e8eaf746578afc37567b0db3f3,
title = "Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs",
abstract = "We consider monochromatic subragraphs in two-colored graphs as guaranteed by Ramsey's theorem, and ask various questions concerning the degree in the two-colored complete graphs of vertices which are part of these subgraphs.",
author = "P. Erdős and G. Chen and Rousseau, {C. C.} and Schelp, {R. H.}",
year = "1993",
month = "5",
doi = "10.1006/eujc.1993.1023",
language = "English",
volume = "14",
pages = "183--189",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs

AU - Erdős, P.

AU - Chen, G.

AU - Rousseau, C. C.

AU - Schelp, R. H.

PY - 1993/5

Y1 - 1993/5

N2 - We consider monochromatic subragraphs in two-colored graphs as guaranteed by Ramsey's theorem, and ask various questions concerning the degree in the two-colored complete graphs of vertices which are part of these subgraphs.

AB - We consider monochromatic subragraphs in two-colored graphs as guaranteed by Ramsey's theorem, and ask various questions concerning the degree in the two-colored complete graphs of vertices which are part of these subgraphs.

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

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

U2 - 10.1006/eujc.1993.1023

DO - 10.1006/eujc.1993.1023

M3 - Article

AN - SCOPUS:38249001359

VL - 14

SP - 183

EP - 189

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

IS - 3

ER -