Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
From MaRDI portal
Publication:2398438
DOI10.1007/s10601-016-9240-3zbMath1368.05046arXiv1510.08266OpenAlexW2257609876MaRDI QIDQ2398438
Michael Frank, Avraham Itzhakov, Michael Codish, Alice Ann Miller
Publication date: 16 August 2017
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.08266
Related Items (6)
Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs ⋮ Optimal-depth sorting networks ⋮ Optimal symmetry breaking for graph problems ⋮ A nonexistence certificate for projective planes of order ten with weight 15 codewords ⋮ Constraints for symmetry breaking in graph representation ⋮ New directions in Ramsey theory
Uses Software
Cites Work
- A new method to construct lower bounds for van der Waerden numbers
- On Ramsey number \(R(4,3,3)\) and triangle-free edge-chromatic graphs in three colors
- Small Ramsey numbers
- Satisfiability and computing van der Waerden numbers
- Constraints for symmetry breaking in graph representation
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Every planar map is four colorable
- R(4, 5) = 25
- Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
