Variable Neighborhood Search for Extremal Graphs: 5. Three Ways to Automate Finding Conjectures


BibTeX reference

The AutoGraphiX (AGX) system determines classes of extremal or near extremal graphs with a Variable Neighborhood Search heuristic. From these, conjectures may be deduced interactively. Three methods, a numerical, a geometric and an algebraic one are proposed to automate also this last step. This leads to automated deduction of previous conjectures, strengthening of a series of conjectures from Graffiti and obtention of several new conjectures, four of which are proved.

, 18 pages

This cahier was revised in May 2002