Ramsey Problems with Bounded Degree Spread

DOI10.1017/S0963548300000663zbMath0795.05098OpenAlexW2115705527MaRDI QIDQ4289293

Guantao Chen, Richard H. Schelp

Publication date: 11 September 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300000663

zbMATH Keywords

bipartite graphsRamsey problemstwo-coloringbounded degree spread

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (4)

Ramsey numbers for degree monotone paths ⋮ Forcing \(k\)-repetitions in degree sequences ⋮ Large Induced Subgraphs with $k$ Vertices of Almost Maximum Degree ⋮ The Erdős-Hajnal conjecture for three colors and triangles

Cites Work

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

This page was built for publication: Ramsey Problems with Bounded Degree Spread