Satisfiability and computing van der Waerden numbers
From MaRDI portal
Publication:1883655
zbMath1054.05097MaRDI QIDQ1883655
Lengning Liu, Victor W. Marek, Michael R. Dransfield, Miroslaw Truszczynski
Publication date: 13 October 2004
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/124096
Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Ramsey theory (05D10)
Related Items (10)
Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking ⋮ On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\) ⋮ Weak Schur numbers and the search for G. W. Walker's lost partitions ⋮ On the n-Color Weak Rado Numbers for the Equation x1+x2+⋯+xk+c=xk+1 ⋮ Bounds on some van der Waerden numbers ⋮ The packing chromatic number of the infinite square lattice is between 13 and 15 ⋮ Optimal symmetry breaking for graph problems ⋮ On orthogonal symmetric chain decompositions ⋮ On generalized Schur numbers of the equation \(x+ay=z\) ⋮ A novel SAT solver for the van der Waerden numbers
This page was built for publication: Satisfiability and computing van der Waerden numbers
