no code implementations • 25 Nov 2015 • Avraham Itzhakov, Michael Codish
For small search problems with a larger number of vertices we demonstrate the computation of instance dependent constraints which are complete.
no code implementations • 28 Oct 2015 • Michael Codish, Michael Frank, Avraham Itzhakov, Alice Miller
The number $R(4, 3, 3)$ is often presented as the unknown Ramsey number with the best chances of being found "soon".
no code implementations • 18 Sep 2014 • Michael Codish, Michael Frank, Avraham Itzhakov, Alice Miller
This paper introduces a general methodology, based on abstraction and symmetry, that applies to solve hard graph edge-coloring problems and demonstrates its use to provide further evidence that the Ramsey number $R(4, 3, 3)=30$.
