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

Paul Erdős; G. Chen; Cecil Rousseau; R. H. Schelp

doi:10.1006/eujc.1993.1023

ScienceGate Book Chapters

JOURNAL ARTICLE

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

Paul Erdős G. Chen Cecil Rousseau R. H. Schelp

Year: 1993 Journal: European Journal of Combinatorics Vol: 14 (3)Pages: 183-189 Publisher: Elsevier BV

DOI: 10.1006/eujc.1993.1023

Get Full-Text PDF Get Analytical Report

Keywords:

Monochromatic color Combinatorics Colored Mathematics Ramsey's theorem Ramsey theory Discrete mathematics Enhanced Data Rates for GSM Evolution Graph Computer science Physics

Metrics

Cited By

0.74

FWCI (Field Weighted Citation Impact)

Refs

0.65

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Advanced Topology and Set Theory

Physical Sciences → Mathematics → Geometry and Topology

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

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

Metrics

Citation History

Topics

Related Documents

On monochromatic subgraphs of edge-colored complete graphs

Edge-colored complete graphs with precisely colored subgraphs

Highly connected monochromatic subgraphs of two-colored complete graphs

Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey

Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring