Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers

From MaRDI portal
Revision as of 04:11, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5636917

DOI10.2307/2037824zbMath0229.05116OpenAlexW4254234165MaRDI QIDQ5636917

Václav Chvátal, Frank Harary

Publication date: 1972

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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




Related Items (35)

On the Ramsey numbers r(G,nH) and r(nG,nH) when n is largeVašek Chvátal: a very short introduction (on the occasion of his 60th birthday)All Ramsey numbers for brooms in graphsGeneralized Ramsey numbers through adiabatic quantum optimizationRamsey numbers based on \(C_ 5\)-decompositionsRamsey numbers \(r(K_ 3,G)\) for connected graphs \(G\) of order sevenRamsey numbers of trees versus fansOn globally sparse Ramsey graphsThe Ramsey numbers r(P\(_m\),K\(_n\))Lower bounds for \(r_2(K_1 + G)\) and \(r_3(K_1 + G)\) from Paley graph and generalizationGeneralized Ramsey theory for graphs, X: Double starsOn the Ramsey numbers of trees with small diameterOn some edge Folkman numbers, small and largeLower bounds for Ramsey numbers of \(K_n\) with a small subgraph removedA note on the Ramsey numbers for theta graphs versus the wheel of order \(5\)Bounds for Ramsey numbers of complete graphs dropping an edgeRamsey numbers of trees and unicyclic graphs versus fansRamsey numbers of ordered graphsGallai-Ramsey numbers for monochromatic triangles or 4-cyclesPath-cycle Ramsey numbersPath-path Ramsey type numbers for the complete bipartite graphA construction for Ramsey numbers for \(K_{m,n}\)Gallai-Ramsey numbers for booksRamsey numbers of trees versus odd cyclesDeleting edges from Ramsey graphsMaximum subgraphs in Ramsey graphsSet and size multipartite Ramsey numbers for starsRamsey Graphs and Block Designs. IRamsey numbers in complete balanced multipartite graphs. I: Set numbersRamsey numbers for cycles in graphsRamsey Theorems for Multiple Copies of GraphsOn multiplicity of quadrilaterals in complete graphsRamsey functions involving \(K_{m,n}\) with \(n\) largeGeneralised Ramsey numbers for small graphsA note on the Ramsey number for small graphs







This page was built for publication: Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers