Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs
From MaRDI portal
Publication:1260770
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
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