Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs

DOI10.1006/eujc.1993.1023zbMath0785.05067OpenAlexW2071379313WikidataQ105962094 ScholiaQ105962094MaRDI QIDQ1260770

Paul Erdős, Guantao Chen, Richard H. Schelp, Cecil C. Rousseau

Publication date: 25 August 1993

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1993.1023

zbMATH Keywords

coloring Ramsey's theorem monochromatic subgraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (14)

Irregularity of Graphs ⋮ Ramsey numbers for degree monotone paths ⋮ Ramsey Problems with Bounded Degree Spread ⋮ Forcing $k$-repetitions in degree sequences ⋮ Unnamed Item ⋮ A combinatorial proof of the Burdzy-Pitman conjecture ⋮ Large induced subgraphs with three repeated degrees ⋮ Large Induced Subgraphs with $k$ Vertices of Almost Maximum Degree ⋮ The irregularity of graphs under graph operations ⋮ Graph irregularity and its measures ⋮ Stepwise irregular graphs ⋮ Graphs with maximal $\sigma$ irregularity ⋮ Equating two maximum degrees ⋮ Total i̇rregulari̇ty of fractal graphs

This page was built for publication: Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs