Diagonal Ramsey numbers for small graphs

DOI10.1002/JGT.3190070108MaRDI QIDQ3658023zbMATH OpenOpenAlexFDO

Authors Stefan A. Burr

Publication date 1983

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190070108

zbMATH Keywords

diagonal Ramsey numbergeneralized Ramsey number

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites work

• All triangle-graph ramsey numbers for connected graphs of order six
• Combinatorial Relations and Chromatic Graphs
• Generalized Ramsey theory for graphs. III: Small off-diagonal numbers

Cited in

(15)

• On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large
• All Ramsey numbers for five vertices and seven or eight edges
• On multicolor Ramsey numbers for complete bipartite graphs
• Generalized Ramsey theory for multiple colors
• Ramsey numbers for all linear forests
• Ramsey numbers for sets of small graphs
• The third Ramsey numbers for graphs with at most four edges
• All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
• Zero-sum problems -- a survey
• Ramsey Theorems for Multiple Copies of Graphs
• Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle
• Graph Ramsey theory and the polynomial hierarchy
• Gallai-Ramsey numbers for rainbow trees and monochromatic complete bipartite graphs
• Target Ramsey numbers in graphs
• Planar unit-distance graphs having planar unit-distance complement

This page was built for publication: Diagonal Ramsey numbers for small graphs

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