Ramsey Theorems for Multiple Copies of Graphs

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

Publication:5181718

DOI10.2307/1997371zbMath0273.05111OpenAlexW4255891826MaRDI QIDQ5181718

Stefan A. Burr, J. H. Spencer

Publication date: 1975

Full work available at URL: https://doi.org/10.2307/1997371




Related Items (38)

Ramsey number of \(K_3\) versus \(F_{3, n}\)Ramsey numbers of a fixed odd-cycle and generalized books and fansRamsey numbers for local coloringsOn the Ramsey numbers r(G,nH) and r(nG,nH) when n is largeWhat can we hope to accomplish in generalized Ramsey theory ?Ramsey numbers for unions of some cyclesOn Ramsey numbers for large disjoint unions of graphsOn zero sum Ramsey numbers: Multiple copies of a graphThe Ramsey numbers for disjoint unions of treesStar-critical Ramsey numbers involving large generalized fansRamsey and 2-local Ramsey numbers for disjoint unions of cyclesThe Ramsey numbers for disjoint unions of cyclesOn the discrepancies of graphsVariations on Ramsey numbers and minimum numbers of monochromatic triangles in line $2$-colorings of configurationsRamsey upper density of infinite graph factorsStar-critical Ramsey numbersA new upper bound for the Ramsey number of fansLocal Ramsey numbers for copies of cyclesA Ramsey-type theorem for multiple disjoint copies of induced subgraphsCoverings by few monochromatic pieces: a transition between two Ramsey problemsOn Ramsey and star-critical Ramsey numbers for generalized fans versus \(n K_m\)Ramsey numbers of connected clique matchingsThe Ramsey numbers for disjoint unions of graphsOn characterizing the critical graphs for matching Ramsey numbersVertex partition of a complete multipartite graph into two kinds of induced subgraphsThe size Ramsey numberRamsey numbers for quadrangles and trianglesGallai-Ramsey numbers for multiple trianglesSur les R-coloriages minimauxImproved bounds on the Ramsey number of fansOn star-critical and upper size Ramsey numbersMinimal Ramsey graphs on deleting stars for generalized fans and booksTrees and $n$-Good HypergraphsRamsey Number of a Connected Triangle MatchingRamsey sequences of graphsRamsey numbers for complete graphs versus generalized fansRamsey number of multiple copies of starsGallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths




Cites Work




This page was built for publication: Ramsey Theorems for Multiple Copies of Graphs