Ramsey numbers by stochastic algorithms with new heuristics
From MaRDI portal
Publication:6567678
DOI10.1007/3-540-61576-8_81zbMATH Open1543.05187MaRDI QIDQ6567678
Publication date: 5 July 2024
Programming involving graphs or networks (90C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
- A note on Ramsey multiplicity
- Sur les proportions respectives de triangles uni, bi ou tricolores dans un tricoloriage des aretes du n-emble
- On the congruence \(x^m+y^m\equiv z^m\pmod p\).
- On a problem of formal logic.
- On the Ramsey numbers N(3,3,\dots ,3;2)
- On Two Classical Ramsey Numbers of the Form $R(3,n)$
- On Parallel Searching
- Search algorithm for Ramsey graphs by union of group orbits
- A lower bound for r(5, 5)
- N(4, 4; 3)≥13
- Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph
- Equation of State Calculations by Fast Computing Machines
- Backtrack Programming
- Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers
- Some remarks on the theory of graphs
- Combinatorial Relations and Chromatic Graphs
This page was built for publication: Ramsey numbers by stochastic algorithms with new heuristics
