Patrick has been implementing a conjecture-making module for INP, based on Fajtlowicz’s Dalmatian heuristic, in order to generate some new possible lower bounds for independence number. The code isn’t independence number specific and can be modified to generate conjectured upper or lower bounds for any graph invariant. After we’re done testing, we’ll write some user notes or at least examples. The code is available here.
The Dalmatian heuristic was first described in Fajtlowicz’s “On Conjectures of Grafitti V” paper (1995). A description can also be found here.