scientific article; zbMATH DE number 19184
[For the entire collection see Zbl 0734.00014.] The classical Ramsey number \(R(s,t)\) is the smallest integer \(n\) such that in any 2-coloring of the edges of \(K_ n\) there is a monochromatic \(K_ s\) in color 1 or else a monochromatic copy of \(K_ t\) in color 2. The author describes the computational experiments with the use of genetic algorithm and simulated annealing for producing Ramsey colorings of complete graphs. These heuristic methods are applied to improve lower bounds for several Ramsey numbers. In particular, he presents good 2- colorings of \(K_{48}\) and \(K_{52}\) thus showing that \(R(4,7)\geq 49\) and \(R(4,8)\geq 53\).
- Linear programming in some Ramsey problems
- Some new Ramsey colorings
- Difference Ramsey numbers and Issai numbers
- Applying tabu search to determine new Ramsey graphs
- Luus-Jaakola optimization procedure for Ramsey number lower bounds
- Computation of Ramsey numbers by P systems with active membranes
- scientific article; zbMATH DE number 4033786 (Why is no real title available?)
- scientific article; zbMATH DE number 4110710 (Why is no real title available?)
- On the Ramsey number R(4,6)
- scientific article; zbMATH DE number 221332 (Why is no real title available?)
- scientific article; zbMATH DE number 842026 (Why is no real title available?)
- Hypergraph Ramsey numbers and adiabatic quantum algorithm
- Lower bounds for Ramsey numbers as a statistical physics problem
- Solving Ramsey number algorithm based on set theory
- Ramsey numbers by stochastic algorithms with new heuristics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976613)
