Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers

DOI10.2307/2037824MaRDI QIDQ5636917zbMATH OpenOpenAlexFDO

Authors Vašek 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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Cited in

(40)

• On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large
• Ramsey numbers based on \(C_ 5\)-decompositions
• Generalized Ramsey theory for graphs, X: Double stars
• Path-cycle Ramsey numbers
• Path-path Ramsey type numbers for the complete bipartite graph
• Ramsey numbers \(r(K_ 3,G)\) for connected graphs \(G\) of order seven
• The Ramsey numbers r(P\(_m\),K\(_n\))
• A note on the Ramsey numbers for theta graphs versus the wheel of order \(5\)
• Gallai-Ramsey numbers for monochromatic triangles or 4-cycles
• Set and size multipartite Ramsey numbers for stars
• Ramsey numbers in complete balanced multipartite graphs. I: Set numbers
• Generalised Ramsey numbers for small graphs
• On the Ramsey numbers of trees with small diameter
• Maximum subgraphs in Ramsey graphs
• Gallai-Ramsey numbers for books
• Deleting edges from Ramsey graphs
• On multiplicity of quadrilaterals in complete graphs
• Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
• Ramsey numbers of trees versus fans
• On some edge Folkman numbers, small and large
• Bounds for Ramsey numbers of complete graphs dropping an edge
• Ramsey numbers for cycles in graphs
• Ramsey functions involving \(K_{m,n}\) with \(n\) large
• All Ramsey numbers for brooms in graphs
• Generalized Ramsey numbers through adiabatic quantum optimization
• On globally sparse Ramsey graphs
• Lower bounds for r₂(K₁ + G) and r₃(K₁ + G) from Paley graph and generalization
• Ramsey Graphs and Block Designs. I
• Lower bounds for Ramsey numbers of \(K_n\) with a small subgraph removed
• Ramsey numbers of trees and unicyclic graphs versus fans
• Ramsey Theorems for Multiple Copies of Graphs
• A note on the Ramsey number for small graphs
• Ramsey numbers of ordered graphs
• Ramsey numbers by stochastic algorithms with new heuristics
• The down-arrow Ramsey set of a graph
• Ramsey numbers of multiple copies of graphs in a component
• Multicolor, multipartite Ramsey numbers for quadrilaterals
• Fan-complete Ramsey numbers
• A construction for Ramsey numbers for \(K_{m,n}\)
• Ramsey numbers of trees versus odd cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5636917)