A combinatorial problem in logic

AbstractThis short note is an application of some theorems of graph theory to the problem of the minimum number of counter-examples needed to show that a special class of theories is complete