Diagonal Ramsey numbers for small graphs

DOI10.1002/jgt.3190070108zbMath0513.05041OpenAlexW2029039946MaRDI QIDQ3658023

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

generalized Ramsey numberdiagonal Ramsey number

Mathematics Subject Classification ID

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

Related Items (13)

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

Cites Work

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

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