Satisfiability and computing van der Waerden numbers
From MaRDI portal
Recommendations
Cited in
(14)- On orthogonal symmetric chain decompositions
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
- Weak Schur numbers and the search for G. W. Walker's lost partitions
- Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
- Theory and Applications of Satisfiability Testing
- A novel SAT solver for the van der Waerden numbers
- On the \(n\)-color weak Rado numbers for the equation \(x_1+x_2+\cdots +x_k+c=x_{k+1}\)
- Optimal symmetry breaking for graph problems
- Theory and Applications of Satisfiability Testing
- On generalized Schur numbers of the equation x+ay=z
- On orthogonal symmetric chain decompositions
- Bounds on some van der Waerden numbers
- Green-Tao Numbers and SAT
- The packing chromatic number of the infinite square lattice is between 13 and 15
This page was built for publication: Satisfiability and computing van der Waerden numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883655)