Diagonal Ramsey numbers for small graphs

DOI10.1002/jgt.3190070108zbMath0513.05041MaRDI 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 number; diagonal Ramsey number

Mathematics Subject Classification ID

05C55: Generalized Ramsey theory

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

Related Items

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, Planar unit-distance graphs having planar unit-distance complement, 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, Zero-sum problems -- a survey

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