R(4, 5) = 25
From MaRDI portal
Publication:4698081
DOI10.1002/jgt.3190190304zbMath0822.05050OpenAlexW2073918695WikidataQ55969769 ScholiaQ55969769MaRDI QIDQ4698081
Brendan D. McKay, Stanislaw P. Radziszowski
Publication date: 14 May 1995
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190190304
Related Items
Subgraph counting identities and Ramsey numbers, The planar Ramsey number \(PR(K_4-e,K_5\)), Breaking symmetries in graph search with canonizing sets, Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking, Ramsey numbers \(r(K_ 3,G)\) for connected graphs \(G\) of order seven, Nonpositive eigenvalues of the adjacency matrix and lower bounds for Laplacian eigenvalues, Gallai–Ramsey number for K5 ${K}_{5}$, The Argument Against Quantum Computers, Boundary graph classes for some maximum induced subgraph problems, Optimal symmetry breaking for graph problems, On the Ramsey numbers for stars versus complete graphs, A class of Ramsey-extremal hypergraphs, New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14), The action of the Weyl group on the \(E_8\) root system, Size Ramsey results for the path of order three, Computing Maximum Unavoidable Subgraphs Using SAT Solvers, New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\), On Some Open Questions for Ramsey and Folkman Numbers, On the Distribution of Monochromatic Complete Subgraphs and Arithmetic Progressions, On local transformation of polygons with visibility properties., Idiosynchromatic poetry
Cites Work
