Constructing extremal triangle-free graphs using integer programming

Ali Erdem Banak, Tınaz Ekim, Z. Caner Taşkın

The maximum number of edges in a graph with matching number m and maximum degree d has been determined in [1] and [2], where some extremal graphs have also been provided. Then, a n…