On a Ramsey-type problem of J. A. Bondy and P. Erdős. I

From MaRDI portal
Revision as of 06:11, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2560421

DOI10.1016/0095-8956(73)90035-XzbMath0261.05118OpenAlexW1983527280MaRDI QIDQ2560421

Vera Rosta

Publication date: 1973

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(73)90035-x




Related Items (36)

New upper bound for multicolor Ramsey number of odd cyclesRamsey numbers for local coloringsThreshold Ramsey multiplicity for odd cyclesThe Ramsey numbers for disjoint unions of cyclesRamsey and Gallai-Ramsey numbers for two classes of unicyclic graphsLong monochromatic Berge cycles in colored 4-uniform hypergraphsRamsey numbers of 3-uniform loose paths and loose cyclesThree results on cycle-wheel Ramsey numbersOn the restricted size Ramsey number for a pair of cyclesThe cycle-complete graph Ramsey number \(r(C_{9}, K_{8})\)On the combinatorial problems which I would most like to see solvedLocal Ramsey numbers for copies of cyclesRamsey numbers for theta graphsPlanar Ramsey numbers for cyclesThe Ramsey Number for 3-Uniform Tight Hypergraph CyclesA multipartite Ramsey number for odd cyclesGallai-Ramsey numbers for monochromatic triangles or 4-cyclesRamsey-goodness -- and otherwisePath-path Ramsey type numbers for the complete bipartite graphOn Ramsey numbers for linear forestsApplications of Ramsey theoryOn some Ramsey numbers for quadrilaterals versus wheelsThe Ramsey numbers for a triple of long cyclesCycles Avoiding a Color in Colorful GraphsThe 3-Colour Ramsey Number of a 3-Uniform Berge CycleStar-critical Ramsey numbers of cycles versus wheelsBipartite Ramsey numbers of cycles for random graphsRamsey Graphs and Block Designs. IThe Ramsey number of 3-uniform loose path versus starOn a Ramsey-type problem of J. A. Bondy and P. Erdős. IICycles Are Strongly Ramsey-UnsaturatedOn the multi-colored Ramsey numbers of cyclesOn the circumference of a graph and its complementOn Ramsey numbers for circuitsRamsey Results for Cycle SpectraNew directions in Ramsey theory



Cites Work


This page was built for publication: On a Ramsey-type problem of J. A. Bondy and P. Erdős. I