Ramsey numbers by stochastic algorithms with new heuristics
From MaRDI portal
Publication:6567678
DOI10.1007/3-540-61576-8_81zbMATH Open1543.05187MaRDI QIDQ6567678FDOQ6567678
Authors: Jihad Mohamad Jaam 
Publication date: 5 July 2024
Recommendations
Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Ramsey theory (05D10)
Cites Work
- Optimization by simulated annealing
- Equation of state calculations by fast computing machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some remarks on the theory of graphs
- Title not available (Why is that?)
- On Parallel Searching
- Combinatorial Relations and Chromatic Graphs
- Backtrack Programming
- Title not available (Why is that?)
- Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers
- Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
- Sur les proportions respectives de triangles uni, bi ou tricolores dans un tricoloriage des aretes du n-emble
- On a problem of formal logic.
- Title not available (Why is that?)
- On the Ramsey numbers N(3,3,\dots ,3;2)
- N(4, 4; 3)≥13
- Title not available (Why is that?)
- Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph
- A note on Ramsey multiplicity
- A lower bound for r(5, 5)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the congruence \(x^m+y^m\equiv z^m\pmod p\).
- Search algorithm for Ramsey graphs by union of group orbits
- Title not available (Why is that?)
- On Two Classical Ramsey Numbers of the Form $R(3,n)$
This page was built for publication: Ramsey numbers by stochastic algorithms with new heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567678)
