Finding Graph Decompositions via SAT

We begin a systematic study of how Graph Decomposition problems may be represented using propositional formulas, and hence solved using SAT-solver technology. By making use of symmetry breaking techniques we are able to obtain solutions to several previously unknown cases and to significantly reduce the time needed to compute decompositions. However some fairly small instances remain unsolved, and thus provide an interesting challenge to SAT-solver technology.

[1]  W. H. Mills,et al.  Some new bibds with k = 6 and λ = 1 , 1995 .

[3]  Toby Walsh,et al.  Breaking Row and Column Symmetries in Matrix Models , 2002, CP.

[4]  Prince Camille de Polignac.  On a Problem in Combinations , 1866 .

[5]  Peter Jeavons,et al.  Symmetry Definitions for Constraint Satisfaction Problems , 2005, CP.

[6]  Victor W. Marek,et al.  Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer , 2016, SAT.

[7]  R.J.R. Abel.  Some new BIBDS with ? = 1 and 6 ?k ? 10 , 1996 .

[8]  Mark H. Liffiton,et al.  A Cardinality Solver: More Expressive Constraints for Free - (Poster Presentation) , 2012, SAT.

[9]  Andrew Grayland,et al.  Snake Lex: An Alternative to Double Lex , 2009, CP.

[10]  Min-Li Yu.  Almost resolvable Pk-decompositions of complete graphs , 1991, J. Graph Theory.

[11]  Peter Adams,et al.  A survey on the existence of G‐Designs , 2008 .

[12]  Min-Li Yu.  On tree factorizations of Kn , 1993, J. Graph Theory.

[14]  Toby Walsh,et al.  Propagation algorithms for lexicographic ordering constraints , 2006, Artif. Intell..

[15]  Miyuki Koshimura,et al.  Solving Open Job-Shop Scheduling Problems by SAT Encoding , 2010, IEICE Trans. Inf. Syst..

[16]  Jean-François Puget.  Symmetry Breaking Using Stabilizers , 2003, CP.

[17]  S. Houghten,et al.  There is no (46, 6, 1) block design* , 2001 .

[18]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[19]  Hantao Zhang,et al.  Combinatorial Designs by SAT Solvers , 2021, Handbook of Satisfiability.

[20]  C. Colbourn,et al.  Handbook of Combinatorial Designs , 2006 .

[21]  Michael Tarsi,et al.  Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture , 1997, SIAM J. Comput..