The Conjecturing Project is to design programs to make conjectures that contribute to mathematical research, as well as other human behaviors that require intelligence.
We are especially interested in using Automated Conjecturing to find new bounds for the independence number of a graph and to extend the class of graphs for which the independence number is efficiently computable. We build on ideas including Fajtlowicz’s Dalmatian heuristic. And we would like to find collaborators for new interesting uses of conjectures.
The Independence Number Project research team was Craig Larson and Patrick Gaskill.