Conjectures of TxGraffiti: Independence, domination, and matchings

TxGraffiti is an automated conjecturing program that produces graph theoretic conjectures in the form of conjectured inequalities. This program, written and maintained by the second author since 2017, was inspired by the successes of previous automated conjecturing programs including Fajtlowicz’s GRAFFITI and DeLaViña’s GRAFFITI.pc. In this paper we prove and generalize several conjectures generated by TxGraffiti when it was prompted to conjecture on the independence number, the domination number, and the matching number (and generalizations of each of these graph invariants). Moreover, in several instances we also show that the proposed inequalities relating these graph invariants are sharp.