A new method to construct lower bounds for van der Waerden numbers
From MaRDI portal
(Redirected from Publication:870059)
Recommendations
- Improving the use of cyclic zippers in finding lower bounds for van der Waerden numbers
- A new lower bound for van der Waerden numbers
- Lower bounds on some Van der Waerden numbers based on quadratic residues
- Lower bounds on van der Waerden numbers: randomized- and deterministic-constructive
- New lower bounds for van der Waerden numbers
Cited in
(16)- 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
- A new lower bound for van der Waerden numbers
- Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
- On the \(n\)-color weak Rado numbers for the equation \(x_1+x_2+\cdots +x_k+c=x_{k+1}\)
- Improving the use of cyclic zippers in finding lower bounds for van der Waerden numbers
- Zero-sum squares in bounded discrepancy \(\{-1,1\}\)-matrices
- A generalization of sets without long arithmetic progressions based on Szekeres algorithm
- Lower bounds on some Van der Waerden numbers based on quadratic residues
- Formalizing finite Ramsey theory in Lean 4
- On orthogonal symmetric chain decompositions
- On the lower bound for the van der Waerden function
- scientific article; zbMATH DE number 22645 (Why is no real title available?)
- Bounds on some van der Waerden numbers
- The packing chromatic number of the infinite square lattice is between 13 and 15
This page was built for publication: A new method to construct lower bounds for van der Waerden numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870059)
