Generalized Ramsey theory for multiple colors

DOI10.1016/0095-8956(76)90016-2zbMath0329.05116OpenAlexW2109099437WikidataQ105709565 ScholiaQ105709565MaRDI QIDQ1227014

Paul Erdős, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp

Publication date: 1976

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(76)90016-2

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

A conjecture on Gallai-Ramsey numbers of even cycles and paths, My Friend and Colleague, Richard Schelp, Bounds for two multicolor Ramsey numbers concerning quadrilaterals, The Ramsey number for a triple of long even cycles, The Ramsey numbers of two sets of cycles, Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree, Generalised Ramsey numbers for two sets of cycles, Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth, Multicolor Ramsey numbers involving graphs with long suspended paths, Exact Ramsey numbers of odd cycles via nonlinear optimisation, The Ramsey numbers for a triple of long cycles, On cycle—Complete graph ramsey numbers, Gallai-Ramsey number of even cycles with chords

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Path Ramsey numbers in multicolorings
• Ramsey numbers for cycles in graphs
• On maximal paths and circuits of graphs
• Diagonal Ramsey numbers for small graphs
• Combinatorial Relations and Chromatic Graphs