Subgraph counting identities and Ramsey numbers

DOI10.1006/jctb.1996.1741zbMath0869.05043OpenAlexW2064794422WikidataQ54278850 ScholiaQ54278850MaRDI QIDQ1354725

Brendan D. McKay, Stanislaw P. Radziszowski

Publication date: 20 August 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/41a94b3ddbf35bc4e67a761f1d585180a3146d88

zbMATH Keywords

Ramsey number

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Generalized Ramsey theory (05C55)

Related Items

Estimating the number of connected components in a graph via subgraph sampling, Accelerating a continuous-time analog SAT solver using GPUs, Gallai–Ramsey number for K5 ${K}_{5}$, Triangular Ramsey Numbers, New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\), On Some Open Questions for Ramsey and Folkman Numbers, Ramsey sequences of graphs, Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete., Idiosynchromatic poetry, New directions in Ramsey theory

Uses Software

• Maple
• LINDO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On finite Ramsey numbers
• Linear programming in some Ramsey problems
• An upper bound for the Ramsey number M(5,4)
• On Sets of Acquaintances and Strangers at any Party
• A lower bound for r(5, 5)
• The value of the Ramsey numberr(3, 8)
• R(4, 5) = 25
• Construction of Special Edge-Chromatic Graphs
• Upper bounds for some Ramsey numbers
• Dichromatic graphs and Ramsey numbers